Intensionality, definability and computation

DOI10.1007/978-3-319-06025-5_5MaRDI QIDQ5249668zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Samson Abramsky

Publication date 11 May 2015

Published in Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.04744

zbMATH Keywords

game semanticsintensionality

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Applications of game theory (91A80)

Abstract: We look at intensionality from the perspective of computation. In particular, we review how game semantics has been used to characterize the sequential functional processes, leading to powerful and flexible methods for constructing fully abstract models of programming languages, with applications in program analysis and verification. In a broader context, we can regard game semantics as a first step towards developing a positive theory of intensional structures with a robust mathematical structure, and finding the right notions of invariance for these structures.

Recommendations

• scientific article; zbMATH DE number 1241700
• Intensional aspects of function definitions
• On the semantics of intensionality
• Dynamic game semantics
• scientific article; zbMATH DE number 1531380

Cited in

(20)

• Intensional computation with higher-order functions
• Meaning and computing: two approaches to computable propositions
• Local local reasoning: a BI-hyperdoctrine for full ground store
• A game-semantic model of computation
• Definability and full abstraction
• On the semantics of intensionality
• scientific article; zbMATH DE number 431759 (Why is no real title available?)
• scientific article; zbMATH DE number 733392 (Why is no real title available?)
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• scientific article; zbMATH DE number 2151710 (Why is no real title available?)
• scientific article; zbMATH DE number 7599980 (Why is no real title available?)
• Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
• scientific article; zbMATH DE number 2236680 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• A metalanguage for guarded iteration
• Computational inductive definability
• An algebraic theory for shared-state concurrency
• Duality, intensionality, and contextuality: philosophy of category theory and the categorical unity of science in Samson Abramsky
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
• Intensional aspects of function definitions

This page was built for publication: Intensionality, definability and computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249668)