Games and full abstraction for the lazy -calculus
| Author(s) : | Guy Mccusker Samson Abramsky, |
| Publisher : | N/A |
| Publication Date : | 1995 |
| ISSN : | N/A |
| Abstract : | We define a category of games G, and its extensional quotient E. A model of the lazy-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively-typed sequential language. 1, |