scientific article

zbMath0760.68035MaRDI QIDQ4027630

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

Publication date: 21 February 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

programming language MLacyclic semi-unificationanalysis of typability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15)

Related Items

Haskell overloading is DEXPTIME-complete ⋮ Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) ⋮ Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types ⋮ Extending the type checker of Standard ML by polymorphic recursion ⋮ Unnamed Item