A simplified account of polymorphic references

DOI10.1016/0020-0190(94)90120-1zbMATH Open0813.68131OpenAlexW1971933951MaRDI QIDQ1334643FDOQ1334643

Authors: Robert Harper 

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90120-1

Recommendations

• A sound polymorphic type system for a dialect of \(C\)
• Type inference for polymorphic references
• The type and effect discipline
• A type soundness proof for variables in LCF ML
• A very modal model of a modern, major, general type system

zbMATH Keywords

functional programmingformal semanticsstructured operational semantics

Mathematics Subject Classification ID

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

Cites Work

• A syntactic approach to type soundness
• Type inference for polymorphic references
• Co-induction in relational semantics
• Standard ML-NJ weak polymorphism and imperative constructs
• Weak polymorphism can be sound

Cited In (11)

• Syntactic type soundness results for the region calculus
• When Homomorphism Becomes a Liability
• Type soundness proofs with definitional interpreters
• An imperative object calculus
• A calculus for concurrent objects
• Trace semantics for polymorphic references
• Functional and Logic Programming
• A linear logical framework
• A note on ``A simplified account of polymorphic references
• Syntactic soundness proof of a type-and-capability system with hidden state
• A type soundness proof for variables in LCF ML

This page was built for publication: A simplified account of polymorphic references

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