Proofs of a set of hybrid let-polymorphic type inference algorithms

DOI10.1007/BF03037279zbMath1085.68028OpenAlexW1980574179MaRDI QIDQ1762932

Kwangkeun Yi, Hyunjun Eo, Oukseh Lee

Publication date: 11 February 2005

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037279

zbMATH Keywords

Let-PolymorphismType Inference AlgorithmType System

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Theory of compilers and interpreters (68N20)

Related Items (2)

Improving type error reporting for type classes ⋮ Systematic identification and communication of type errors

Uses Software

• ML
• OCaml

Cites Work

• Unnamed Item
• A theory of type polymorphism in programming
• Type inference with partial types
• Explaining type inference
• Compositional explanation of types and algorithmic debugging of type errors
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Proofs of a set of hybrid let-polymorphic type inference algorithms