Games and Full Abstraction for the Lazy lambda-calculus

Games and Full Abstraction for the Lazy lambda-calculus (1995)

Cached

Download Links

[users.comlab.ox.ac.uk]
[www.cogs.susx.ac.uk]

Other Repositories/Bibliography

DBLP

by Samson Abramsky , Guy Mccusker

Venue:	In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science
Citations:	128 - 9 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Games and Full Abstraction for the Lazy lambda-calculus	user correction - Legacy Corrections
AUTHOR NAME	Samson Abramsky	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computing; Imperial College of Science, Technology and Medicine	SVM HeaderParse 0.2
AUTHOR ADDR	180 Queen's Gate; London SW7 2BZ; United Kingdom	SVM HeaderParse 0.1
AUTHOR NAME	Guy Mccusker	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computing; Imperial College of Science, Technology and Medicine	SVM HeaderParse 0.2
AUTHOR ADDR	180 Queen's Gate; London SW7 2BZ; United Kingdom	SVM HeaderParse 0.1
ABSTRACT	ion for the Lazy -calculus Samson Abramsky Guy McCusker Department of Computing Imperial College of Science, Technology and Medicine 180 Queen's Gate London SW7 2BZ United Kingdom 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 model in E . This model is shown to be fully abstract 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 Introduction Full Abstraction is a key concept in programming language semantics [9, 12, 23, 26]. The ingredients are as follows. We are given a language L, with an `observational preorder' - on terms in L such that P - Q means that every observable property of P is also satisfied by Q; and a denotational model MJ\DeltaK. The model M is then said to be f...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	234--243	INFERENCE
VOLUME	105	INFERENCE
CITATIONS	27 found	ParsCit 1.0