Declarative object identity using relation types
US8527946B2 · kind B2 · utility
6Cited by
8References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 6, 2007 |
| Grant date | Sep 3, 2013 |
| Priority date | — |
| Expiry date | Jan 30, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4488
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention provides a programming model based on a relational view of the heap which defines identity declaratively, obviating the need for equals( ) and hashcode( ) methods. Each element in the heap (called a tuple) belongs to a relation type and relates an immutable identity to mutable state. The model entails a stricter contract: identity never changes during an execution. Objects, values, and singletons arise as special cases of tuples.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.