Coq formalization of the higher-order recursive path ordering (Q843949): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PoplMark / rank
 
Normal rank
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/s00200-009-0105-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998337489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program extraction from normalization proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / 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: HORPO with Computability Closure: A Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formulation of the simple theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Automated Termination Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective proof of the well-foundedness of the multiset path ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic higher-order recursive path orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Orderings for Normal Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Higher-Order Recursive Path Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Proving Termination of Term Rewriting by Matrix Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving open properties by induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2852349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778883 / rank
 
Normal rank

Latest revision as of 09:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Coq formalization of the higher-order recursive path ordering
scientific article

    Statements

    Coq formalization of the higher-order recursive path ordering (English)
    0 references
    0 references
    18 January 2010
    0 references
    0 references
    Coq
    0 references
    HORPO
    0 references
    Higher-order rewriting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references