Lazy productivity via termination
From MaRDI portal
Publication:549188
DOI10.1016/j.tcs.2011.03.024zbMath1216.68136OpenAlexW2153634616MaRDI QIDQ549188
Jörg Endrullis, Dimitri Hendriks
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.024
productivitylazy evaluationterminationterm rewritingstrong sequentialitycontext-sensitive rewritingmatrix interpretations
Related Items (8)
Unnamed Item ⋮ Unnamed Item ⋮ Transducer degrees: atoms, infima and suprema ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Proving semantic properties as first-order satisfiability ⋮ Applications and extensions of context-sensitive rewriting ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly sequential and inductively sequential term rewriting systems
- Productivity of stream definitions
- Matrix interpretations for proving termination of term rewriting
- An extensional treatment of dataflow deadlock
- Sequentiality in orthogonal term rewriting systems
- Termination of term rewriting: Interpretation and type elimination
- Context-sensitive rewriting strategies
- Transfinite reductions in orthogonal term rewriting systems
- A term calculus for (co-)recursive definitions on streamlike data structures
- Sufficient-completeness, ground-reducibility and their complexity
- Local Termination: theory and practice
- Well-definedness of Streams by Transformation and Termination
- Lazy Rewriting and Context-Sensitive Rewriting
- Termination of Lazy Rewriting Revisited
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Termination of String Rewriting with Matrix Interpretations
- Transforming Outermost into Context-Sensitive Rewriting
- From Outermost Termination to Innermost Termination
- Well-Definedness of Streams by Termination
- From Outermost to Context-Sensitive Rewriting
- Termination for direct sums of left-linear complete term rewriting systems
- Termination of context-sensitive rewriting
- Proving Termination in the Context-Sensitive Dependency Pair Framework
- A Transformational Approach to Prove Outermost Termination Automatically
- Complexity of Fractran and Productivity
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- Productivity of Stream Definitions
- Data-Oblivious Stream Productivity
- Improving Context-Sensitive Dependency Pairs
This page was built for publication: Lazy productivity via termination
