Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-04222-5_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1505638068 / rank
 
Normal rank
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: Argument Filterings and Usable Rules for Simply Typed Dependency Pairs / 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: Solving Partial Order Constraints for LPO Termination / 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: 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: Comparing curried and uncurried rewriting / 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: Proving Termination Using Recursive Path Orders and SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular and incremental automated termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778888 / rank
 
Normal rank

Latest revision as of 08:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
scientific article

    Statements

    Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (English)
    0 references
    0 references
    0 references
    7 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references