Uncurrying for termination and complexity (Q352959): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4447246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / 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: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalization results for typeable rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: HORPO with Computability Closure: A Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix interpretations for proving termination of term rewriting / 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: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating the dependency pair method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncurrying for Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Complexity Analysis Based on the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic higher-order recursive path orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing curried and uncurried rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Order Dependency Pairs for Algebraic Functional Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characteristics of strong innermost normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing dependency pair method using strong computability in simply-typed term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular properties of conditional term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Derivational Complexity Induced by the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Extensions Preserve Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized and Formalized Uncurrying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncurrying for termination and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Complexity Analysis via Relative Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of Non-linear (Ir)rational Arithmetic / rank
 
Normal rank

Revision as of 14:25, 6 July 2024

scientific article
Language Label Description Also known as
English
Uncurrying for termination and complexity
scientific article

    Statements

    Uncurrying for termination and complexity (English)
    0 references
    0 references
    0 references
    0 references
    5 July 2013
    0 references
    term rewriting
    0 references
    termination
    0 references
    uncurrying
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers