Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes (original) (raw)
Related papers
Decidable call-by-need computations in term rewriting
Information and Computation, 2005
Recognizability of Redexes for Higher-Order Rewrite Systems
IPSJ Online Transactions, 2009
Information and Computation, 1990
Confluence of Right Ground Term Rewriting Systems is Decidable
Foundations of Software Science and Computational …, 2005
IEICE Transactions on Information and Systems, 2010
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science, 1994
IPSJ Online Transactions, 2009
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science, 2012
Semantics of non-terminating rewrite systems using minimal coverings
1995
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters, 1998
Confluence of Shallow Right-Linear Rewrite Systems
Lecture Notes in Computer Science, 2005
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
IEICE Transactions on Information and Systems, 2009
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation, 2007
Decision problems in ordered rewriting
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
IEICE Transactions on Information and Systems, 2005
Lecture Notes in Computer Science, 1981
Decidable call by need computations in term rewriting (extended abstract)
Lecture Notes in Computer Science, 1997
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters, 2003
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
2016
Modular proofs for completeness of hierarchical term rewriting systems
Theoretical Computer Science, 1995
Specification of reduction strategies in term rewriting systems
Lecture Notes in Computer Science, 1987
Proving Termination of Higher-Order Rewrite Systems
1993
Relative Undecidability in Term Rewriting Part 2: The Confluence Hierarchy
2002
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure
Lecture Notes in Computer Science, 2004
Levels of undecidability in rewriting
Information and Computation, 2011
Simple termination of rewrite systems
Theoretical Computer Science, 1997
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
IPSJ Online Transactions, 2011
Bottom-up rewriting for words and terms
Journal of Symbolic Computation, 2015
Natural Rewriting for General Term Rewriting Systems
2004
A higher order unification algorithm for bi-rewriting systems
1993
On Ground-Confluence of Term Rewriting Systems
Information and Computation, 1990
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract)
1991
A path ordering for proving termination of term rewriting systems
Mathematical Foundations of …, 1985
Formalizing the Confluence of Orthogonal Rewriting Systems
Electronic Proceedings in Theoretical Computer Science, 2013
The size-change principle and dependency pairs for termination of term rewriting
Applicable Algebra in Engineering, Communication and Computing, 2005