Games and Definability For FPC

DOI10.2307/421149zbMath0894.03012OpenAlexW2057113534MaRDI QIDQ4372924

Guy McCusker

Publication date: 17 December 1997

Published in: 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

definabilitytype theorygamesfunctional language

Mathematics Subject Classification ID

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

Related Items (3)

Totality in arena games ⋮ A relational account of call-by-value sequentiality ⋮ Games and full abstraction for FPC.

Cites Work

• Unnamed Item
• Linear logic
• A note on inconsistencies caused by fixpoints in a cartesian closed category
• LCF considered as a programming language
• Games and full completeness for multiplicative linear logic
• Axiomatic Domain Theory in Categories of Partial Maps

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