Logical Full Abstraction and PCF

Logical Full Abstraction and PCF (1996)

by John Longley , Gordon Plotkin

Venue:	Tbilisi Symposium on Language, Logic and Computation. SiLLI/CSLI
Citations:	13 - 5 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Logical Full Abstraction and PCF	user correction - Legacy Corrections
AUTHOR NAME	John Longley	SVM HeaderParse 0.1
AUTHOR NAME	Gordon Plotkin	SVM HeaderParse 0.1
ABSTRACT	ion and PCF John Longley Gordon Plotkin March 15, 1996 Abstract We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with "parallel" operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider restrictions on logical complexity and on the level of types. 1 Introduction The study of denotational semantics seeks to provide mathematical descriptions of programming languages by giving denotations of programs in terms of previously understood mathematical structures. For example, if P is a program that takes an input and produces an output, we might take its denotation to be a function from a set of input-values to a set of output-values. The most widely-known approach to denotational semantics is that of traditiona...	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
VENUE	Tbilisi Symposium on Language, Logic and Computation. SiLLI/CSLI	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	333--352	INFERENCE
CITATIONS	19 found	ParsCit 1.0