Local Termination
From MaRDI portal
Publication:3636830
DOI10.1007/978-3-642-02348-4_19zbMath1242.68130OpenAlexW2912121759MaRDI QIDQ3636830
Johannes Waldmann, Jörg Endrullis, Roel de Vrijer
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_19
Related Items (3)
Reachability, confluence, and termination analysis with state-compatible automata ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Automatic Termination
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Matrix interpretations for proving termination of term rewriting
- Match-bounded string rewriting systems
- The combinator S
- Termination of term rewriting using dependency pairs
- Structural Analysis of Narratives with the Coq Proof Assistant
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Proving Infinitary Normalization
- A Transformational Approach to Prove Outermost Termination Automatically
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Rewriting Techniques and Applications
This page was built for publication: Local Termination