scientific article
From MaRDI portal
Publication:2980977
DOI10.23638/LMCS-13(1:12)2017zbMath1398.68274arXiv1610.05156MaRDI QIDQ2980977
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1610.05156
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability analysis over term rewriting systems
- Termination criteria for tree automata completion
- Mechanizing and improving dependency pairs
- Flow analysis of lazy higher-order functional programs
- Equational approximations for tree automata completion
- Sequentiality, monadic second-order logic and tree automata.
- Towards Static Analysis of Functional Programs Using Tree Automata Completion
- Analysing the complexity of functional programs: higher-order meets first-order
- Proving Termination of Programs Automatically with AProVE
- Term Rewriting and All That
- Handling Left-Quadratic Rules When Completing Tree Automata
- Closure of Tree Automata Languages under Innermost Rewriting
- C-SHORe
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Model-Checking Higher-Order Programs with Recursive Types
- Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
- Model Checking Higher-Order Programs
- Polymorphic functions with set-theoretic types
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Term Rewriting and Applications
- Rewriting Techniques and Applications
This page was built for publication:
