|
Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/199
|
| Title: | A Per Model of Polymorphism and Recursive Types |
| Authors: | Abadi, Martin
Plotkin, Gordon |
| Issue Date: | 5-Nov-2003 |
| Abstract: | A model of Reynolds’ polymorphic lambda calculus is provided, which also allows the recursive
definition of elements and types. The technique
is to use a good class of partial equivalence relations over a certain cpo. This allows the combination of inverse-limits for recursion and intersection for polymorphism. |
| Keywords: | Laboratory for Foundations of Computer Science |
| URI: | http://hdl.handle.net/1842/199 |
| Appears in Collections: | Informatics Publications
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|
