Efficient second-order matching
From MaRDI portal
Publication:5055870
Recommendations
Cites work
- scientific article; zbMATH DE number 4164171 (Why is no real title available?)
- scientific article; zbMATH DE number 176135 (Why is no real title available?)
- A unification algorithm for typed -calculus
- Higher order E-unification
- Higher-order unification revisited: Complete sets of transformations
- Isabelle. A generic theorem prover
- Modular higher-order E-unification
- Proving and applying program transformations expressed with second-order patterns
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
- scientific article; zbMATH DE number 176135 (Why is no real title available?)
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)