Declarative Object Identity Using Relation Types

Vaziri, Mandana; Tip, Frank; Fink, Stephen J.; Dolby, Julian

doi:10.1007/978-3-540-73589-2_4

Cited by 22 publications

(42 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…More to the point, programmers make good use of equality in collections, and (at least in our sample) generally navigate Java's equality contracts successfully: equality is generally based on fully initialised immutable state, and collections can safely rely on stable equality. Proposals such as Baker's EGAL [9], Relation Types [12], and the various schemes for managing object initialisation [18,20,21] may well provide good language support for objects which enter collections, so long as they can cope with the relatively high number of objects performing delayed initialisation; while objects which do not enter collections seem to be adequately served by object identity, as they do not change their equality.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Understanding the Impact of Collection Contracts on Design

Nelson

Pearce

Noble

2010

Objects, Models, Components, Patterns

View full text Add to dashboard Cite

Abstract. Java provides a specification for a user-defined general purpose equivalence operator for objects, but collections such as Set have more stringent requirements. This inconsistency breaks polymorphism: programmers must take care to follow Set's contract rather than the more general Object contract if their object could enter a Set. We have dynamically profiled 30 Java applications to better understand the way programmers design their objects, to determine whether they program with collections in mind. Our results indicate that objects which enter collections behave very differently to objects which do not. Our findings should help developers understand the impact of design choices they make, and guide future language designers when adding support for collections and/or equality.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Vaziri et al [12] describe Relation Types, special kinds of classes whose equality and hash codes are automatically computed based on their "key" fields, which must be final. Relation Types use hash-consing to ensure that each of their instances are unique as far as values for these key fields are concerned.…”

Section: Object Identity and Equalitymentioning

confidence: 99%

Understanding the Impact of Collection Contracts on Design

Nelson

Pearce

Noble

2010

Objects, Models, Components, Patterns

View full text Add to dashboard Cite

show abstract

“…Many authors propose adding relations to both generaland special-purpose programming languages (e.g., [5,17,19,23]). We focus on the orthogonal problem of specifying and implementing the underlying representations for relational data.…”

Section: Discussion and Related Workmentioning

confidence: 99%

An introduction to data representation synthesis

et al. 2012

View full text Add to dashboard Cite

We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies. We describe a language of decompositions that permits the user to specify different concrete representations for relations, and show that operations on concrete representations soundly implement their relational specification. We also describe an auto-tuner that automatically identifies the best decomposition for a particular workload. It is easy to incorporate data representations synthesized by our compiler into existing systems, leading to code that is simpler, correct by construction, and comparable in performance to the code it replaces.

show abstract

“…Vaziri et al [24] give a declarative syntax for specifying the interning pattern in Java. They use the term "relation type" for an interned class.…”

Section: Interningmentioning

confidence: 99%

Aeronautics and Astronautics

Mulder¹

2011

View full text Add to dashboard Cite

This paper introduces the Checker Framework, which supports adding pluggable type systems to the Java language in a backwardcompatible way. A type system designer defines type qualifiers and their semantics, and a compiler plug-in enforces the semantics. Programmers can write the type qualifiers in their programs and use the plug-in to detect or prevent errors. The Checker Framework is useful both to programmers who wish to write error-free code, and to type system designers who wish to evaluate and deploy their type systems.The Checker Framework includes new Java syntax for expressing type qualifiers; declarative and procedural mechanisms for writing type-checking rules; and support for flow-sensitive local type qualifier inference and for polymorphism over types and qualifiers. The Checker Framework is well-integrated with the Java language and toolset.We have evaluated the Checker Framework by writing 5 checkers and running them on over 600K lines of existing code. The checkers found real errors, then confirmed the absence of further errors in the fixed code. The case studies also shed light on the type systems themselves.

show abstract

Declarative Object Identity Using Relation Types

Cited by 22 publications

References 17 publications

Understanding the Impact of Collection Contracts on Design

Understanding the Impact of Collection Contracts on Design

An introduction to data representation synthesis

Aeronautics and Astronautics

Contact Info

Product

Resources

About