Full Abstraction and the Context Lemma

DOI10.1137/S0097539791224212zbMath0856.03013OpenAlexW2150022661WikidataQ124846189 ScholiaQ124846189MaRDI QIDQ4887022

Albert R. Meyer, Trevor Jim

Publication date: 24 February 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791224212

zbMATH Keywords

\(\lambda\)-calculusfull abstractionPCFstable functionsstandardizationformalization of programming languagesMilner's Context Lemmaterm-rewriting semantics

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Labelled reductions, runtime errors, and operational subsumption ⋮ Stable bistructure models of PCF ⋮ Reasoning about multi-stage programs ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ A stable programming language ⋮ Decidability of behavioural equivalence in unary PCF ⋮ Observational program calculi and the correctness of translations

This page was built for publication: Full Abstraction and the Context Lemma