Higher order unification 30 years later (Extended abstract)

DOI10.1007/3-540-45685-6_2MaRDI QIDQ4484328zbMATH OpenFDO

Authors Gérard Huet

Publication date 12 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2410/24100003.htm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Natural language processing (68T50)

Recommendations

• Higher-order unification and matching
• A combinatory logic approach to higher-order E-unification
• Higher order E-unification
• Modular higher-order E-unification
• Functions-as-constructors Higher-order Unification

Cited in

(4)

• Higher-order unification: a structural relation between Huet's method and the one based on explicit substitutions
• Higher-order unification and matching
• What is essential unification?
• A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading

This page was built for publication: Higher order unification 30 years later (Extended abstract)

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