A type soundness proof for variables in LCF ML

DOI10.1016/0020-0190(95)00146-4MaRDI QIDQ672255zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1479622
• scientific article; zbMATH DE number 1670740
• A sound polymorphic type system for a dialect of \(C\)
• A simplified account of polymorphic references
• Type inference verified: Algorithm \(\mathcal W\) in Isabelle/H0L

Cites work

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

Cited in

(1)

• scientific article; zbMATH DE number 1479622 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672255)