Abstract abstract reduction
DOI10.1016/J.JLAP.2005.04.001zbMATH Open1086.68068OpenAlexW2045528636MaRDI QIDQ817587FDOQ817587
Authors: Georg Struth 
Publication date: 16 March 2006
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2005.04.001
Recommendations
rewritingformal mathematicssemiringsKleene algebra\(\lambda \)-calculustermination analysis\(\omega \)-algebraabstract reductionChurch-Rosser theorems
Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40)
Cites Work
- A calculational approach to mathematical induction
- Some lambda calculus and type theory formalized
- 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?)
- More Church-Rosser proofs (in Isabelle/HOL)
- A completeness theorem for Kleene algebras and the algebra of regular events
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kleene algebra with domain
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular Algebra Applied to Path-finding Problems
- Relational and Kleene-Algebraic Methods in Computer Science
- Parallel reductions in \(\lambda\)-calculus
- Completion of a Set of Rules Modulo a Set of Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mechanical proof of the Church-Rosser theorem
- Title not available (Why is that?)
- The variety of Kleene algebras with conversion is not finitely based
- Title not available (Why is that?)
- Bi-rewrite systems
- Title not available (Why is that?)
- Termination by completion
- On the union of well-founded relations
Cited In (14)
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- Algebraic coherent confluence and higher globular Kleene algebras
- Relation-algebraic verification of Prim's minimum spanning tree algorithm
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Title not available (Why is that?)
- Abstract blowing down
- Title not available (Why is that?)
- Automated verification of refinement laws
- Structures for abstract rewriting
- An abstract formulation for rewrite systems
- An algebraic framework for minimum spanning tree problems
- Modal tools for separation and refinement
- Abstract strategies and coherence
- Algebraic characterizations for reduction systems
This page was built for publication: Abstract abstract reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817587)
