Full abstraction and the Context Lemma (preliminary report)

DOI10.1007/3-540-54415-1_44zbMath1493.68090OpenAlexW2286874387MaRDI QIDQ5096215

Trevor Jim, Albert R. Meyer

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_44

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

A first order logic of effects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• The system \({\mathcal F}\) of variable types, fifteen years later
• Sequential algorithms on concrete data structures
• Domain theory in logical form
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Fundamental concepts in programming languages
• Data Types as Lattices
• Logic and programming languages
• Bisimulation can't be traced
• What is a model of the lambda calculus?

This page was built for publication: Full abstraction and the Context Lemma (preliminary report)