Full Abstraction and the Context Lemma
From MaRDI portal
Publication:4887022
DOI10.1137/S0097539791224212zbMath0856.03013WikidataQ124846189 ScholiaQ124846189MaRDI QIDQ4887022
Publication date: 24 February 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
\(\lambda\)-calculus; full abstraction; PCF; stable functions; standardization; formalization of programming languages; Milner's Context Lemma; term-rewriting semantics
68W30: Symbolic computation and algebraic computation
68N15: Theory of programming languages
68Q55: Semantics in the theory of computing
68Q42: Grammars and rewriting systems
03B40: Combinatory logic and lambda calculus
Related Items
Labelled reductions, runtime errors, and operational subsumption, Reasoning about multi-stage programs, On generic context lemmas for higher-order calculi with sharing, Decidability of behavioural equivalence in unary PCF, Observational program calculi and the correctness of translations, A stable programming language