A very modal model of a modern, major, general type system

Abstract : We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate languages and typed assembly languages used for object-oriented and functional languages. We establish in this purely semantic fashion a soundness proof of the typing systems underlying these TILs and TALs---ensuring that every well-typed program is safe. The technique is generic, and applies to any small-step semantics including λ-calculus, labeled transition systems, and von Neumann machines. It is also simple, and reduces mainly to defining a Kripke semantics of the Gödel-Löb logic of provability. We have mechanically verified in Coq the soundness of our type system as applied to a von Neumann machine.
Document type :
Conference papers
Complete list of metadatas

Contributor : Jérôme Vouillon <>
Submitted on : Friday, June 1, 2007 - 11:35:58 AM
Last modification on : Friday, January 4, 2019 - 5:32:59 PM




Andrew W. Appel, Paul-André Melliès, Christopher D. Richards, Jérôme Vouillon. A very modal model of a modern, major, general type system. Annual Symposium on Principles of Programming Languages, 2007, Nice, France. pp.109-122, ⟨10.1145/1190216.1190235⟩. ⟨hal-00150978⟩



Record views