A type assignment system for game semantics
From MaRDI portal
(Redirected from A type assignment system for game semantics)
Recommendations
Cites work
- A complete characterization of complete intersection-type preorders
- A filter lambda model and the completeness of type assignment
- An extension of basic functionality theory for -calculus
- Domain theory in logical form
- Full abstraction for PCF
- Functional Characters of Solvable Terms
- Geometry of Interaction and linear combinatory algebras
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 4099289 (Why is no real title available?)
- scientific article; zbMATH DE number 1342276 (Why is no real title available?)
- scientific article; zbMATH DE number 2080222 (Why is no real title available?)
- Linear realizability and full completeness for typed lambda-calculi
- Principal type schemes for an extended type theory
- Retracing some paths in process algebra
- Types for Proofs and Programs
Cited in
(8)- A type assignment for -calculus complete both for FPTIME and strong normalization
- Innocent game semantics via intersection type assignment systems
- Inhabitation for non-idempotent intersection types
- Game semantics for type soundness
- Plays as resource terms via non-idempotent intersection types
- lambda!-calculus, Intersection Types, and Involutions
- Dependent Types for Extensive Games
- Essential and relational models
This page was built for publication: A type assignment system for game semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930873)