scientific article; zbMATH DE number 4180772

MaRDI QIDQ3204025zbMATH OpenFDO

Authors Assaf Kfoury, Jerzy Tiuryn, Paweł Urzyczyn

Publication date 1989

zbMATH Keywords

first-order unificationpolymorphic \(\lambda \) -calculusType-check functional programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42)

Recommendations

• Semi-unification
• scientific article; zbMATH DE number 4092757
• The undecidability of the semi-unification problem
• scientific article; zbMATH DE number 88941
• scientific article; zbMATH DE number 176152

Cited in

(14)

• On the expressive power of finitely typed and universally polymorphic recursive procedures
• On subsumption and semiunification in feature algebras
• The undecidability of the semi-unification problem
• Type inference with partial types
• scientific article; zbMATH DE number 440473 (Why is no real title available?)
• On complexity of the anti-unification problem
• scientific article; zbMATH DE number 3952479 (Why is no real title available?)
• scientific article; zbMATH DE number 36613 (Why is no real title available?)
• scientific article; zbMATH DE number 1222419 (Why is no real title available?)
• scientific article; zbMATH DE number 549987 (Why is no real title available?)
• Efficient general AGH-unification
• Termination of rule-based calculi for uniform semi-unification
• Type inference in polymorphic type discipline
• Generalized partial computation using disunification to solve constraints

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 Q3204025)