The categorical abstract machine
Science of Computer Programming
Theoretical Computer Science
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Fully abstract semantics for observably sequential languages
Information and Computation
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Kripke logical relations and PCF
Information and Computation
Theoretical Computer Science
Domains and lambda-calculi
Game-theoretic analysis of call-by-value computation
Theoretical Computer Science
Theoretical Computer Science - Special issue on linear logic, 1
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Theoretical Computer Science
ACM Transactions on Computational Logic (TOCL)
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
On the Symmetry of Sequentiality
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Generalised Flowcharts and Games
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A New Approach to Control Flow Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
Observational Equivalence of 3rd-Order Idealized Algol is Decidable
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Non-Deterministic Games and Program Analysis: An Application to Security
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Data-abstraction refinement: a game semantic approach
SAS'05 Proceedings of the 12th international conference on Static Analysis
Some Programming Languages Suggested by Game Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing in asynchronous games
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, several full completeness results have been shown since the early nineties. In this note, we review the relation between definability and full abstraction, and we put a few old and recent results of this kind in perspective.