Skip to main content
Article thumbnail
Location of Repository

A Type Soundness Proof for Variables in LCF ML

By Dennis Volpano and Geoffrey Smith

Abstract

We prove the soundness of a polymorphic type system for a language with variables, assignments, and rst-class functions. As a corollary, this proves the soundness of the Edinburgh LCF ML rules for typing variables and assignments, thereby settling a long-standing open problem

Topics: Type theory, formal semantics, variables and assignment
Year: 1995
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.8443
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.fiu.edu/~smithg/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.