Encoding types in ML-like languages

DOI10.1016/j.tcs.2003.11.017zbMath1072.68032OpenAlexW2002278483MaRDI QIDQ1826630

Zhe Yang

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.017

zbMATH Keywords

Hindley-Milner type system

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Type-safe pattern combinators ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

Uses Software

• ML
• Haskell
• Polyp
• MiniML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The system \({\mathcal F}\) of variable types, fifteen years later
• A theory of type polymorphism in programming
• Revised report on the algorithmic language scheme
• Dynamic typing: Syntax and proof theory
• A modal analysis of staged computation
• Functional unparsing
• A system of constructor classes: overloading and implicit higher-order polymorphism
• Dynamic typing in polymorphic languages
• The Principal Type-Scheme of an Object in Combinatory Logic
• The second Futamura projection for type-directed partial evaluation

This page was built for publication: Encoding types in ML-like languages