Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AProVE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tyrolean / 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/978-3-540-70590-1_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1496435538 / 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: On the Implementation of Construction Functions for Non-free Concrete Data Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanically proving termination using polynomial interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Pairs for Rewriting with Non-free Constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Solving for Termination Analysis with Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778873 / 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: Proving Termination by Bounded Increase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized rewriting: An alternative to rewriting modulo a set of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular and incremental proofs of AC-termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank
 
Normal rank

Latest revision as of 14:35, 28 June 2024

scientific article
Language Label Description Also known as
English
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
scientific article

    Statements

    Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (English)
    0 references
    0 references
    0 references
    28 August 2008
    0 references
    0 references
    0 references

    Identifiers