Well-Definedness of Streams by Termination

DOI10.1007/978-3-642-02348-4_12zbMath1239.68037OpenAlexW2160964864MaRDI QIDQ3636825

Hans Zantema

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_12

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items

CIRC: A Behavioral Verification Tool Based on Circular Coinduction, A Tool Proving Well-Definedness of Streams Using Termination Tools, Bisimulations Generated from Corecursive Equations, Coalgebras in functional programming and type theory, Behavioral Rewrite Systems and Behavioral Productivity, Lazy productivity via termination

Uses Software

• CIRC
• Tyrolean

Cites Work

• Termination of term rewriting using dependency pairs
• CIRC: A Circular Coinductive Prover
• The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
• Automatic Sequences
• A coinductive calculus of streams
• Data-Oblivious Stream Productivity
• Logic for Programming, Artificial Intelligence, and Reasoning
• Unnamed Item