Proving Infinitary Normalization

DOI10.1007/978-3-642-02444-3_5MaRDI QIDQ3638246zbMATH OpenOpenAlexFDO

Authors Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel de Vrijer

Publication date 2 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://research.vu.nl/ws/files/2709252/243602.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Normalization of Infinite Terms
• Infinitary normalization
• Weak Convergence and Uniform Normalization in Infinitary Rewriting
• Infinite terms and infinite rewritings
• On modularity in infinitary term rewriting

Cites work

• Infinitary normalization
• Initial Algebra Semantics and Continuous Algebras
• Matrix Interpretations for Proving Termination of Term Rewriting
• Normalization of Infinite Terms
• Productivity of Stream Definitions
• Termination of term rewriting using dependency pairs
• Termination of term rewriting: Interpretation and type elimination

Cited in

(11)

• Proof of the law of infinite conjunction using the perfect disjunctive normal form
• Transducer degrees: atoms, infima and suprema
• Proving infinitary formulas
• Normalization of Infinite Terms
• A coinductive framework for infinitary rewriting and equational reasoning
• Formalized proofs of the infinity and normal form predicates in the first-order theory of rewriting
• Infinitary normalization
• Coinductive foundations of infinitary rewriting and infinitary equational logic
• Local Termination
• Highlights in infinitary rewriting and lambda calculus
• Infinitary rewriting: closure operators, equivalences and models

This page was built for publication: Proving Infinitary Normalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638246)