Full Abstraction by Translation

Full Abstraction by Translation (1996)

by Guy Mccusker

Venue:	Proc., 3rd Workshop in Theory and Formal Methods
Citations:	4 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Full Abstraction by Translation	user correction - Legacy Corrections
AUTHOR NAME	Guy Mccusker	SVM HeaderParse 0.1
ABSTRACT	This paper shows how a fully abstract model for a rich metalanguage like FPC can be used to prove theorems about other languages. In particular, we use results obtained from a game semantics of FPC to show that the natural translation of the lazy -calculus into the metalanguage is fully abstract, thus obtaining a new full abstraction result from an old one. The proofs involved are very easy---all the hard work was done in giving the original games model. So far we have been unable to prove the completeness of our translation without recourse to the denotational model; we therefore have an indication of the worth of such fully abstract models. 1 Introduction Plotkin, in his CSLI notes [18], showed how denotational semantics can be viewed as a two-stage process. First one defines a metalanguage which describes elements of the intended semantic model, usually some category of domains. Then to give semantics to a language L it suffices to translate it into the metalanguage. While this is ...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	Proc., 3rd Workshop in Theory and Formal Methods	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	20 found	ParsCit 1.0