A type assignment system for game semantics

Authors:
Pietro Di Gianantonio;Furio Honsell;Marina Lenisa
Affiliations:
Dipartimento di Matematica e Informatica, Università di Udine, via delle Scienze 206, 33100 Udine, Italy;Dipartimento di Matematica e Informatica, Università di Udine, via delle Scienze 206, 33100 Udine, Italy;Dipartimento di Matematica e Informatica, Università di Udine, via delle Scienze 206, 33100 Udine, Italy
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 0

Full abstraction for PCF

Information and Computation
A complete characterization of complete intersection-type preorders

ACM Transactions on Computational Logic (TOCL)
Game Semantics for Untyped lambda beta eta-Calculus

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Geometry of Interaction and linear combinatory algebras

Mathematical Structures in Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a type assignment system that provides a finitary interpretation of lambda terms in a game semantics model. Traditionally, type assignment systems describe the semantic interpretation of terms in domain-theoretic models. Quite surprisingly, the type assignment system presented in this paper is very similar to the traditional ones, the main difference being the omission of the subtyping rules.