scientific article; zbMATH DE number 125891

MaRDI QIDQ4027630zbMATH OpenFDO

Authors Assaf Kfoury, Jerzy Tiuryn, Paweł Urzyczyn

Publication date 21 February 1993

zbMATH Keywords

acyclic semi-unificationanalysis of typabilityprogramming language ML

Mathematics Subject Classification ID

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

Recommendations

• An analysis of ML typability
• Haskell overloading is DEXPTIME-complete
• Typability and type checking in System F are equivalent and undecidable
• scientific article; zbMATH DE number 1330133
• scientific article; zbMATH DE number 88941

Cited in

(9)

• Extending the type checker of Standard ML by polymorphic recursion
• Haskell overloading is DEXPTIME-complete
• Almost every simply typed -term has a long -reduction sequence
• scientific article; zbMATH DE number 1330133 (Why is no real title available?)
• An analysis of ML typability
• scientific article; zbMATH DE number 7029315 (Why is no real title available?)
• An analysis of the Core-ML language: Expressive power and type reconstruction
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types

This page was built for publication:

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