A type system for a lambda calculus with assignments

DOI10.1007/3-540-57887-0_103MaRDI QIDQ4490735zbMATH OpenFDO

Authors Kung Chen, Martin Odersky

Publication date 20 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57887-0_103

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• A type soundness proof for variables in LCF ML
• Taming effects with monadic typing
• Taming effects with monadic typing
• A Polymorphic Type System for the Lambda-Calculus with Constructors
• A calculus with polymorphic and polyvariant flow types

Cited in

(8)

• Standard ML-NJ weak polymorphism and imperative constructs
• System F-omega with equirecursive types for datatype-generic programming
• A type system for call-by-name exceptions
• A Polymorphic Type System for the Lambda-Calculus with Constructors
• A Type Theory with Mixed Constructivity and Assignments
• A logical view of assignments
• A type soundness proof for variables in LCF ML
• Using typed lambda calculus to implement formal systems on a machine

This page was built for publication: A type system for a lambda calculus with assignments

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