## A Reflective Model of Inheritance (1992)

### Cached

### Download Links

- [www-osl.cs.uiuc.edu]
- [www.neci.nj.nec.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 8 - 0 self |

### BibTeX

@MISC{Jagannathan92areflective,

author = {Suresh Jagannathan and Gul Agha},

title = {A Reflective Model of Inheritance},

year = {1992}

}

### Years of Citing Articles

### OpenURL

### Abstract

ions are introduced using notation; conditionals are written using !; application is expressed by juxtaposition of the function being applied with its arguments. Recursion is expressed using letrec . 3.1 Records Records are non-strict finite associations of labels to values. The constituent expressions in a record are evaluated relative to the record's evaluation environment. The value of a record field can be retrieved using the "." operator: if r is a record, then evaluating r:x returns the binding value of x as defined in r. We provide one other operation over records. Let r 1 and r 2 be two records and let Dom(r) be the set of names defined within record r. The join or composition of r 1 and r 2 (written (ffl r 1 r 2 )) is now defined as follows: (ffl r 1 r 2 ):x = ae r 2 :x if x 2 Dom(r2) r 1 :x otherwise 3 Besides these basic syntactic forms, we introduce various syntactic extensions (or abbreviations) throughout the paper; these extensions are best thought of as macros th...