Efficient second-order matching
DOI10.1007/3-540-61464-8_62zbMATH Open1503.68098OpenAlexW1563949308MaRDI QIDQ5055870FDOQ5055870
Authors: Régis Curien, Zhenyu Qian, Hui Shi 
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_62
Recommendations
Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Isabelle. A generic theorem prover
- Proving and applying program transformations expressed with second-order patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Higher-order unification revisited: Complete sets of transformations
- Modular higher-order E-unification
- Higher order E-unification
Cited In (11)
- Matching Modulo Superdevelopments Application to Second-Order Matching
- Building proofs or counterexamples by analogy in a resolution framework
- Second-Order Behavior of Pattern Search
- Analogy in automated deduction: a survey
- Tractable and intractable second-order matching problems
- Inductive Logic Programming
- Higher-order matching for program transformation
- Deterministic second-order patterns
- Partial matching for analogy discovery in proofs and counter-examples
- Logic for Programming, Artificial Intelligence, and Reasoning
- Title not available (Why is that?)
Uses Software
This page was built for publication: Efficient second-order matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055870)
