2007/04/01 by Pierre-Louis Curien · 1 citation
Computer Science · #Abstraction #Artificial Intelligence in Games #Computer science #Epistemology #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Philosophy #Programming language
paper · pdf · doi:10.1016/j.entcs.2007.02.011
openalex publication_date 2007/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02
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.