Decidable higher-order unification problems
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 635-649
- https://doi.org/10.1007/3-540-58156-1_46
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Learning and applying generalised solutions using higher order resolutionPublished by Springer Nature ,2005
- Higher-order narrowingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Logic programming in the LF logical frameworkPublished by Cambridge University Press (CUP) ,1991
- Simple second-order languages for which unification is undecidableTheoretical Computer Science, 1991
- The TPS theorem proving systemPublished by Springer Nature ,1990
- Higher-order unification revisited: Complete sets of transformationsJournal of Symbolic Computation, 1989
- A unification algorithm for second-order monadic termsAnnals of Pure and Applied Logic, 1988
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- Canonical Forms and Unification.Published by Defense Technical Information Center (DTIC) ,1980
- A unification algorithm for typed -calculusTheoretical Computer Science, 1975