A type soundness proof for variables in LCF ML

DOI10.1016/0020-0190(95)00146-4zbMath0875.68623OpenAlexW1997282149MaRDI QIDQ672255

Juan-Miguel Gracia

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00146-4

zbMATH Keywords

Type theoryFormal semanticsVariables and assignment

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Cites Work

• Type inference for polymorphic references
• A simplified account of polymorphic references
• Edinburgh LCF. A mechanized logic of computation

This page was built for publication: A type soundness proof for variables in LCF ML