|
Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/223
|
| Title: | Lax Logical Relations |
| Authors: | Plotkin, Gordon Power, John Sannella, Donald Tennent, Robert |
| Issue Date: | 2000 |
| Citation: | AUTOMATA LANGUAGES AND PROGRAMMING LECTURE NOTES IN COMPUTER SCIENCE 1853: 85-102 2000 |
| Publisher: | SPRINGER-VERLAG |
| Abstract: | Lax logical relations are a categorical generalisation of logical
relations; though they preserve product types, they need not preserve
exponential types. But, like logical relations, they are preserved by the
meanings of all lambda-calculus terms.We show that lax logical relations
coincide with the correspondences of Schoett, the algebraic relations of
Mitchell and the pre-logical relations of Honsell and Sannella on Henkin
models, but also generalise naturally to models in cartesian closed categories
and to richer languages. |
| Keywords: | Laboratory for Foundations of Computer Science |
| URI: | http://hdl.handle.net/1842/223 |
| ISSN: | 0302-9743 |
| Appears in Collections: | Informatics Publications
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|