Definability and full abstraction
From MaRDI portal
Recommendations
Cites work
- A new type assignment for λ-terms
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Concrete domains
- Domain theory in logical form
- Explicit substitutions
- Finitary PCF is not decidable
- Foundations of Software Science and Computation Structures
- Full abstraction for PCF
- Fully abstract models of typed \(\lambda\)-calculi
- Fully abstract semantics for observably sequential languages
- Game-theoretic analysis of call-by-value computation
- Games and full completeness for multiplicative linear logic
- scientific article; zbMATH DE number 431771 (Why is no real title available?)
- scientific article; zbMATH DE number 1808198 (Why is no real title available?)
- scientific article; zbMATH DE number 4005580 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- scientific article; zbMATH DE number 2061712 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- scientific article; zbMATH DE number 234028 (Why is no real title available?)
- Kripke logical relations and PCF
- LCF considered as a programming language
- Linear logic
- Mechanizing logical relations
- On denotational completeness
- On full abstraction for PCF: I, II and III
- On infinite -expansion
- On the symmetry of sequentiality
- Payoffs, intensionality and abstraction in games
- Probabilistic game semantics
- Sequential algorithms for unbounded nondeterminism
- Sequential algorithms on concrete data structures
- Sequentiality in an extensional framework
- Static Analysis
- The categorical abstract machine
- The regular-language semantics of second-order idealized ALGOL
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The sequentially realizable functionals
- Unary PCF is decidable
Cited in
(16)- Fully abstract trace semantics for protected module architectures
- A game-semantic model of computation
- Some programming languages suggested by game models (extended abstract)
- Full abstraction for nominal Scott domains
- Full abstraction, totality and PCF
- A higher-order calculus of computational fields
- Full Abstraction and the Context Lemma
- A fully abstract game semantics for countable nondeterminism
- Full abstraction and the Context Lemma (preliminary report)
- Normal forms, linearity, and prime algebraicity over nonflat domains
- Observable interface behaviour and inheritance
- On the reification of semantic linearity
- On a higher-order calculus of computational fields
- The far side of the cube. An elementary introduction to game semantics
- Extended addressing machines for PCF, with explicit substitutions
- A fully abstract model of PCF based on extended addressing machines
This page was built for publication: Definability and full abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864154)
