Capturing constrained constructor patterns in matching logic
From MaRDI portal
Publication:2096417
Recommendations
Cites work
- A constructor-based reachability logic for rewrite theories
- A constructor-based reachability logic for rewrite theories
- A lattice-theoretical fixpoint theorem and its applications
- Conditional rewriting logic as a unified model of concurrency
- Constructing infinitary quotient-inductive types
- Folding variant narrowing and optimal variant termination
- Generalized rewrite theories, coherence completion, and symbolic methods
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- Matching logic
- Matching logic explained
- One-path reachability logic
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Results on the propositional \(\mu\)-calculus
- Twenty years of rewriting logic
- Variant narrowing and equational unification
Cited in
(2)
This page was built for publication: Capturing constrained constructor patterns in matching logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096417)