The Computability Path Ordering: The End of a Quest (Q3540166): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Termination checking with types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of strong normalization in the algebraic-λ-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-based termination of recursive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions by rewriting in the Calculus of Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Closure: Ten Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive-data-type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Termination: From Kruskal to Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: HORPO with Computability Closure: A Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monotonic Higher-Order Semantic Path Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings and Constraints: Theory and Practice of Proving Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating sized types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the untyped lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Orderings for Normal Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic higher-order recursive path orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recursive path ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of combined (rewrite and λ-calculus) systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting in the Calculus of Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent types for program termination verification / rank
 
Normal rank

Latest revision as of 19:48, 28 June 2024

scientific article
Language Label Description Also known as
English
The Computability Path Ordering: The End of a Quest
scientific article

    Statements

    The Computability Path Ordering: The End of a Quest (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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