Open Access
VOL. 2 | 1998 Syntax and Semantics of Type Assignment Systems
Hirofumi Yokouchi

Editor(s) Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi

MSJ Memoirs, 1998: 99-141 (1998) DOI: 10.2969/msjmemoirs/00201C030


This paper gives a survey on syntax and semantics for type assignment systems, with a special attention to semantic completeness of the systems. Starting with the most basic system with function types only, it introduces polymorphic types, intersection types, union types, and existential type quantifier in a step-by-step manner. It also provides several sequent-style formulations of type assignment systems. With the sequent calculi, it shows the properties of type assignment systems concerning the completeness and the conservativity of various systems.


Published: 1 January 1998
First available in Project Euclid: 17 January 2014

zbMATH: 0935.03025
MathSciNet: MR1728760

Digital Object Identifier: 10.2969/msjmemoirs/00201C030

Rights: Copyright © 1998, The Mathematical Society of Japan

Vol. 2 • 1 January 1998
Back to Top