A simplified account of polymorphic references

DOI10.1016/0020-0190(94)90120-1zbMath0813.68131OpenAlexW1971933951MaRDI QIDQ1334643

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

zbMATH Keywords

formal semanticsstructured operational semanticsfunctional programming

Mathematics Subject Classification ID

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

Related Items

A note on ``A simplified account of polymorphic references, An imperative object calculus, A linear logical framework, A calculus for concurrent objects, A type soundness proof for variables in LCF ML, Syntactic soundness proof of a type-and-capability system with hidden state, Syntactic type soundness results for the region calculus

Cites Work

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