Q2980977 (Q2980977): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.05156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing the complexity of functional programs: higher-order meets first-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2958380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling Left-Quadratic Rules When Completing Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-SHORe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic functions with set-theoretic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5277872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequentiality, monadic second-order logic and tree automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis over term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure of Tree Automata Languages under Innermost Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Static Analysis of Functional Programs Using Tree Automata Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination criteria for tree automata completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational approximations for tree automata completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5277878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Programs Automatically with AProVE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow analysis of lazy higher-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Higher-Order Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking Higher-Order Programs with Recursive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order multi-parameter tree transducers and recursion schemes for program verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying higher-order functional programs with pattern-matching algebraic data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723905 / rank
 
Normal rank

Latest revision as of 19:17, 13 July 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    0 references
    8 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    term rewriting systems
    0 references
    strategy
    0 references
    tree automata
    0 references
    functional program
    0 references
    static analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references