|
Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/181
|
| Title: | FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES |
| Authors: | Abadi, Martin
Pierce, Benjamin
Plotkin, Gordon |
| Issue Date: | 3-Nov-2003 |
| Abstract: | We explore ideal models for a programming language with recursive polymorphic
types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable
ideals yields a close fit between models and programming language. Two of our semantics
of type expressions are faithful, in the sense that programs that behave identically in all
contexts have exactly the same types. |
| Keywords: | Polymorphism
recursive types
full abstraction
ideals
metric models
Laboratory for Foundations of Computer Science |
| URI: | http://hdl.handle.net/1842/181 |
| Appears in Collections: | Informatics Publications
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|
