Higher-order proof by consistency
From MaRDI portal
Publication:6567778
DOI10.1007/3-540-62034-6_56zbMATH Open1541.68177MaRDI QIDQ6567778
Olav Lysne, Henrik Linnestad, Christian Prehofer
Publication date: 5 July 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proofs by induction in equational theories with constructors
- On sufficient-completeness and related properties of term rewriting systems
- Isabelle. A generic theorem prover
- Extending Bachmair's method for proof by consistency to the final algebra
- A logic programming language with lambda-abstraction, function variables, and simple unification
- A termination ordering for higher order rewrite systems
- Towards a domain theory for termination proofs
- Decidable higher-order unification problems
- Proof by consistency in conditional equational theories
- Term rewriting induction
This page was built for publication: Higher-order proof by consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567778)
