Higher-order pattern anti-unification in linear time
From MaRDI portal
Publication:2362208
DOI10.1007/s10817-016-9383-3zbMath1407.68089OpenAlexW2501889234WikidataQ59603004 ScholiaQ59603004MaRDI QIDQ2362208
Jordi Levy, Temur Kutsia, Alexander Baumgartner, Mateu Villaret
Publication date: 6 July 2017
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-016-9383-3
Related Items (5)
Unnamed Item ⋮ Anti-unification and the theory of semirings ⋮ Term-Graph Anti-Unification ⋮ Higher-order pattern generalization modulo equational theories ⋮ A Generic Framework for Higher-Order Generalizations.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of system \(F\) with subtyping
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Bottom-up induction of feature terms
- Higher order generalization and its application in program verification
- Anti-unification for unranked terms and hedges
- A modular order-sorted equational generalization algorithm
- E-generalization using grammars
- A Library of Anti-unification Algorithms
- Higher-order term indexing using substitution trees
- A Variant of Higher-Order Anti-Unification
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- Anti-unification Algorithms and Their Applications in Program Analysis
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Generalizing generalized tries
- Introduction to generalized type systems
- Nominal Anti-Unification
- Logic Programming
- Inductive Logic Programming
- Nominal Unification from a Higher-Order Perspective
This page was built for publication: Higher-order pattern anti-unification in linear time
