An analysis of ML typability

DOI10.1145/174652.174659MaRDI QIDQ4299012zbMATH OpenOpenAlexFDO

Authors Assaf Kfoury, Jerzy Tiuryn, Paweł Urzyczyn

Publication date 13 February 1995

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174652.174659

zbMATH Keywords

acyclic semi-unification\(\mathbf{ML}\) typability

Mathematics Subject Classification ID

Theory of programming languages (68N15) Parallel algorithms in computer science (68W10) Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 125891
• The correctness of Newman's typability algorithm and some of its extensions
• scientific article; zbMATH DE number 1330133
• Haskell overloading is DEXPTIME-complete
• Typability in bounded dimension

Cited in

(13)

• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• Haskell overloading is DEXPTIME-complete
• The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• Computing ML equality kinds using abstract interpretation
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Type inference for first-class messages with feature constraints
• Domain-free \(\lambda\mu\)-calculus
• Weakly complete problems are not rare
• Type reconstruction in finite rank fragments of the second-order -calculus
• The complexity ecology of parameters: An illustration using bounded max leaf number
• scientific article; zbMATH DE number 125891 (Why is no real title available?)

This page was built for publication: An analysis of ML typability

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