scientific article; zbMATH DE number 6825413
From MaRDI portal
Publication:4600775
DOI10.23638/LMCS-14(1:3)2018zbMath1459.68089arXiv1706.00677MaRDI QIDQ4600775
Jörg Endrullis, Dimitri Hendriks, Alexandra Silva, Andrew Polonsky, Helle Hvid Hansen
Publication date: 12 January 2018
Full work available at URL: https://arxiv.org/abs/1706.00677
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Equational logic, Mal'tsev conditions (08B05) Grammars and rewriting systems (68Q42)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lazy productivity via termination
- Applications of infinitary lambda calculus
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Completely iterative algebras and completely iterative monads
- The minimalist MOVE operation in a deductive perspective
- Confluence of the coinductive \(\lambda\)-calculus
- Transfinite reductions in orthogonal term rewriting systems
- Highlights in infinitary rewriting and lambda calculus
- Infinitary rewriting: closure operators, equivalences and models
- On confluence and residuals in Cauchy convergent transfinite rewriting
- Local Termination: theory and practice
- Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus
- Normalization of Infinite Terms
- Proving Infinitary Normalization
- Term Rewriting and All That
- A Coinductive Confluence Proof for Infinitary Lambda-Calculus
- Proof Terms for Infinitary Rewriting
- Complexity of Fractran and Productivity
- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
- ABSTRACT MODELS OF TRANSFINITE REDUCTIONS
- PARTIAL ORDER INFINITARY TERM REWRITING AND BÖHM TREES
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- An introduction to (co)algebra and (co)induction
- Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
This page was built for publication:
