You have Guest access.
Log In
Andrei Voronkov
Front matter
1-16
Modular Termination of Basic Narrowing
17-31
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
32-47
Term-Graph Rewriting Via Explicit Paths
48-62
Finer Is Better: Abstraction Refinement for Rewriting Approximations
63-78
A Needed Rewriting Strategy for Data-Structures with Pointers
79-93
Effectively Checking the Finite Variant Property
94-109
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
110-125
Maximal Termination
126-141
Usable Rules for Context-Sensitive Rewrite Systems
142-156
Combining Equational Tree Automata over AC and ACI Theories
157-171
Closure of Hedge-Automata Languages by Hedge Rewriting
172-186
On Normalisation of Infinitary Combinatory Reduction Systems
187-201
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
202-216
Arctic Termination ...Below Zero
217-231
Logics and Automata for Totally Ordered Trees
232-245
Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks
246-260
Nominal Unification from a Higher-Order Perspective
261-275
Functional-Logic Graph Parser Combinators
276-290
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
291-305
Tree Automata for Non-linear Arithmetic
306-320
Confluence by Decreasing Diagrams Converted
321-335
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
336-350
Root-Labeling
351-365
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
366-380
Deciding Innermost Loops
381-391
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
392-408
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
409-424
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
425-440
Reduction Under Substitution
441-455
Normalization of Infinite Terms
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info