Definability and full abstraction
From MaRDI portal
Publication:2864154
DOI10.1016/J.ENTCS.2007.02.011zbMATH Open1277.68120DBLPjournals/entcs/Curien07OpenAlexW4301945969WikidataQ56092887 ScholiaQ56092887MaRDI QIDQ2864154FDOQ2864154
Authors: Pierre-Louis Curien 
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
Recommendations
Cites Work
- Domain theory in logical form
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Title not available (Why is that?)
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Game-theoretic analysis of call-by-value computation
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Title not available (Why is that?)
- Games and full completeness for multiplicative linear logic
- Finitary PCF is not decidable
- Fully abstract semantics for observably sequential languages
- The sequentially realizable functionals
- On the symmetry of sequentiality
- Kripke logical relations and PCF
- Title not available (Why is that?)
- Fully abstract models of typed \(\lambda\)-calculi
- The regular-language semantics of second-order idealized ALGOL
- Foundations of Software Science and Computation Structures
- Probabilistic game semantics
- Static Analysis
- Sequential algorithms on concrete data structures
- Title not available (Why is that?)
- Explicit substitutions
- A new type assignment for λ-terms
- Concrete domains
- Sequentiality in an extensional framework
- Mechanizing logical relations
- The categorical abstract machine
- Title not available (Why is that?)
- Unary PCF is decidable
- On denotational completeness
- Sequential algorithms for unbounded nondeterminism
- On infinite \(\eta\)-expansion
- Payoffs, intensionality and abstraction in games
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Full abstraction, totality and PCF
- A higher-order calculus of computational fields
- A game-semantic model of computation
- Fully abstract trace semantics for protected module architectures
- Full abstraction for nominal Scott domains
- The far side of the cube. An elementary introduction to game semantics
- Some programming languages suggested by game models (extended abstract)
- On a higher-order calculus of computational fields
- Normal forms, linearity, and prime algebraicity over nonflat domains
- Observable interface behaviour and inheritance
- On the reification of semantic linearity
- Full abstraction and the Context Lemma (preliminary report)
- Title not available (Why is that?)
- Full Abstraction and the Context Lemma
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)
