Definability and full abstraction

DOI10.1016/J.ENTCS.2007.02.011MaRDI QIDQ2864154zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

denotational semanticssequentialityoperational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Intensionality, definability and computation
• Game semantics for call-by-value polymorphism
• Full abstraction for nominal general references
• scientific article; zbMATH DE number 1342245
• What's in a game?

Cites work

• 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?)
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• A new type assignment for λ-terms
• 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
• 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 Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The categorical abstract machine
• The regular-language semantics of second-order idealized ALGOL
• The sequentially realizable functionals
• Unary PCF is decidable

Cited in

(14)

• Full abstraction, totality and PCF
• A game-semantic model of computation
• A higher-order calculus of computational fields
• 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)
• scientific article; zbMATH DE number 7533349 (Why is no real title available?)
• 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)