Definability and Full Abstraction
From MaRDI portal
Publication:2864154
DOI10.1016/j.entcs.2007.02.011zbMath1277.68120DBLPjournals/entcs/Curien07OpenAlexW4301945969WikidataQ56092887 ScholiaQ56092887MaRDI QIDQ2864154
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.011
Related Items (9)
Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ On a higher-order calculus of computational fields ⋮ A Higher-Order Calculus of Computational Fields ⋮ Fully abstract trace semantics for protected module architectures ⋮ Observable interface behaviour and inheritance ⋮ On the reification of semantic linearity ⋮ Unnamed Item ⋮ Some Programming Languages Suggested by Game Models (Extended Abstract) ⋮ A game-semantic model of computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- The categorical abstract machine
- Sequential algorithms on concrete data structures
- Domain theory in logical form
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Unary PCF is decidable
- Concrete domains
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Sequentiality in an extensional framework
- Fully abstract semantics for observably sequential languages
- On denotational completeness
- On infinite \(\eta\)-expansion
- The sequentially realizable functionals
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- The regular-language semantics of second-order idealized ALGOL
- Kripke logical relations and PCF
- Game-theoretic analysis of call-by-value computation
- A new type assignment for λ-terms
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Games and full completeness for multiplicative linear logic
- Payoffs, Intensionality and Abstraction in Games
- Explicit substitutions
- Foundations of Software Science and Computation Structures
- Probabilistic game semantics
- On the symmetry of sequentiality
- Mechanizing logical relations
- Static Analysis
- Finitary PCF is not decidable
- Sequential algorithms for unbounded nondeterminism
This page was built for publication: Definability and Full Abstraction
