Full Abstraction and the Context Lemma
DOI10.1137/S0097539791224212zbMATH Open0856.03013OpenAlexW2150022661WikidataQ124846189 ScholiaQ124846189MaRDI QIDQ4887022FDOQ4887022
Authors: Trevor Jim, Albert R. Meyer 
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
Recommendations
- Full abstraction and the Context Lemma (preliminary report)
- Full abstraction, totality and PCF
- Definability and full abstraction
- scientific article; zbMATH DE number 1523049
- Full abstraction in the lazy lambda calculus
- Full abstraction and recursion
- General conditions for full abstraction
- Full abstraction and expressive completeness for FP
- Full abstraction and limiting completeness in equational languages
- Full abstraction for polymorphic \(\pi \)-calculus
standardizationfull abstractionPCF\(\lambda\)-calculusstable functionsformalization of programming languagesMilner's Context Lemmaterm-rewriting semantics
Theory of programming languages (68N15) Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)
Cited In (9)
- Stable bistructure models of PCF
- Full abstraction, totality and PCF
- Decidability of behavioural equivalence in unary PCF
- Observational program calculi and the correctness of translations
- A stable programming language
- Reasoning about multi-stage programs
- Full abstraction and the Context Lemma (preliminary report)
- Labelled reductions, runtime errors, and operational subsumption
- On generic context lemmas for higher-order calculi with sharing
This page was built for publication: Full Abstraction and the Context Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887022)
