Games and Definability For FPC

DOI10.2307/421149MaRDI QIDQ4372924zbMATH OpenOpenAlexFDO

Authors Guy McCusker

Publication date 17 December 1997

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL http://www.math.ucla.edu/~asl/bsl/0303-toc.htm

zbMATH Keywords

definabilityfunctional languagegamestype theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Games and full abstraction for FPC.
• Full abstraction for PCF
• scientific article; zbMATH DE number 1259144

Cites work

• A note on inconsistencies caused by fixpoints in a cartesian closed category
• Axiomatic Domain Theory in Categories of Partial Maps
• Games and full completeness for multiplicative linear logic
• scientific article; zbMATH DE number 3972838 (Why is no real title available?)
• LCF considered as a programming language
• Linear logic

Cited in

(7)

• Nondeterminacy and recursion via stacks and games
• Games and full abstraction for FPC.
• A relational account of call-by-value sequentiality
• Definable sets of real numbers, infinite games and core model theory
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• Infinite Games, Inductive Definitions and Transfinite Recursion
• Totality in arena games

This page was built for publication: Games and Definability For FPC

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