Extending the type checker of Standard ML by polymorphic recursion

DOI10.1016/S0304-3975(98)00139-XzbMath0913.68188MaRDI QIDQ1275627

Hans Leiß, Martin Emms

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Functional programmingType inferencePolymorphic recursion

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Uses Software

• ML

Cites Work

• The undecidability of the semi-unification problem
• A theory of type polymorphism in programming
• A Machine-Oriented Logic Based on the Resolution Principle
• The Principal Type-Scheme of an Object in Combinatory Logic
• Modified basic functionality in combinatory logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending the type checker of Standard ML by polymorphic recursion