UID:
almahu_9948621534502882
Umfang:
X, 315 p.
,
online resource.
Ausgabe:
1st ed. 2004.
ISBN:
9783540259794
Serie:
Lecture Notes in Computer Science, 3091
Anmerkung:
Termination Analysis of the Untyped ?-Calculus -- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems -- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms -- Monadic Second-Order Unification Is NP-Complete -- A Certified AC Matching Algorithm -- Matchbox: A Tool for Match-Bounded String Rewriting -- TORPA: Termination of Rewriting Proved Automatically -- Querying Unranked Trees with Stepwise Tree Automata -- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation -- Rewriting for Fitch Style Natural Deductions -- Efficient ?-Evaluation with Interaction Nets -- Proving Properties of Term Rewrite Systems via Logic Programs -- On the Modularity of Confluence in Infinitary Term Rewriting -- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting -- Automated Termination Proofs with AProVE -- An Approximation Based Approach to Infinitary Lambda Calculi -- Böhm-Like Trees for Term Rewriting Systems -- Dependency Pairs Revisited -- Inductive Theorems for Higher-Order Rewriting -- The Joinability and Unification Problems for Confluent Semi-constructor TRSs -- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.
In:
Springer Nature eBook
Weitere Ausg.:
Printed edition: ISBN 9783662195642
Weitere Ausg.:
Printed edition: ISBN 9783540221531
Sprache:
Englisch
URL:
https://doi.org/10.1007/b98160
