A type assignment system for game semantics
From MaRDI portal
Publication:930873
DOI10.1016/j.tcs.2008.01.023zbMath1146.68048MaRDI QIDQ930873
Marina Lenisa, Furio Honsell, Pietro Di Gianantonio
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear realizability and full completeness for typed lambda-calculi
- Principal type schemes for an extended type theory
- An extension of basic functionality theory for \(\lambda\)-calculus
- Domain theory in logical form
- Full abstraction for PCF
- A filter lambda model and the completeness of type assignment
- Functional Characters of Solvable Terms
- Geometry of Interaction and linear combinatory algebras
- A complete characterization of complete intersection-type preorders
- Types for Proofs and Programs
- Retracing some paths in process algebra