An analysis of ML typability

DOI10.1145/174652.174659zbMath0806.68016OpenAlexW2002837892MaRDI QIDQ4299012

A. J. Kfoury, Paweł Urzyczyn, Jerzy Tiuryn

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)

Related Items

Strong normalization from weak normalization in typed \(\lambda\)-calculi, Weakly complete problems are not rare, Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version), The Power of Non-determinism in Higher-Order Implicit Complexity, Domain-Freeλµ-Calculus, Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus, 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, The complexity ecology of parameters: An illustration using bounded max leaf number, TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS