Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (Q5164173): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3016713933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 25 years of TACAS: TOOLympics, held as part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings. Part III / rank
 
Normal rank
Property / cites work
 
Property / cites work: FORT 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Termination Proofs Using CeTA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5369502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability for left-linear growing term rewriting systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability, confluence, and termination analysis with state-compatible automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving non-termination by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequentiality, monadic second-order logic and tree automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank

Latest revision as of 02:21, 27 July 2024

scientific article; zbMATH DE number 7423373
Language Label Description Also known as
English
Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting
scientific article; zbMATH DE number 7423373

    Statements

    Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (English)
    0 references
    0 references
    0 references
    10 November 2021
    0 references
    formalization
    0 references
    first-order theory of rewriting
    0 references
    tree automata
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references