An algebraic characterization of typability in ML with subtyping

DOI10.1007/3-540-49019-1_8MaRDI QIDQ4260703zbMATH OpenFDO

Authors Marcin Benke

Publication date 1999

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

Full work available at URL https://doi.org/10.1007/3-540-49019-1_8

zbMATH Keywords

functional language MLpolymorphismsubtypingtypability

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An analysis of ML typability
• Polymorphism, subtyping, and type inference in MLsub
• ML typability is DEXPTIME-complete
• scientific article; zbMATH DE number 18625

Cited in

(2)

• ML typability is DEXPTIME-complete
• An analysis of ML typability

This page was built for publication: An algebraic characterization of typability in ML with subtyping

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