Capturing constrained constructor patterns in matching logic

DOI10.1016/J.JLAMP.2022.100810OpenAlexW4294796238WikidataQ114159182 ScholiaQ114159182MaRDI QIDQ2096417

Yanyan Li

Publication date: 16 November 2022

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2022.100810

zbMATH Keywords

matching logicorder-sorted algebrasconstrained constructor patterns

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Conditional rewriting logic as a unified model of concurrency
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• A constructor-based reachability logic for rewrite theories
• Twenty years of rewriting logic
• Folding variant narrowing and optimal variant termination
• Matching logic explained
• Constructing infinitary quotient-inductive types
• Generalized rewrite theories, coherence completion, and symbolic methods
• A lattice-theoretical fixpoint theorem and its applications
• Matching Logic
• A Constructor-Based Reachability Logic for Rewrite Theories
• All-Path Reachability Logic
• Variant Narrowing and Equational Unification
• One-Path Reachability Logic

This page was built for publication: Capturing constrained constructor patterns in matching logic