Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Full Abstraction for PCF
HTML
Details
Locations
Year:
2000
Type:
article
Source:
Information and Computation
DOI:
10.1006/inco.2000.2930
Authors:
Samson Abramsky,
Radha Jagadeesan,
Pasquale Malacaria
Institutions:
University of Oxford,
Loyola University Chicago,
Queen Mary University of London
Language:
English
Topic:
Logic, programming, and type systems
Subfield:
Software
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
PCF,
full abstraction,
intensional semantics,
definability,
effective model,
universality theorem,
observational equivalence,
simply typed lambda calculus
show all 8
Open Access status:
bronze
Funders:
National Science Foundation,
Office of Naval Research
OpenAlex ID:
W2002845021
FWCI:
30.28
Cites:
64
Cited by:
557
Related to:
9