|
|
|
|
| LEADER |
02702nmm a2200385 u 4500 |
| 001 |
EB000652367 |
| 003 |
EBX01000000000000000505449 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540259794
|
| 100 |
1 |
|
|a Oostrom, Vincent van
|e [editor]
|
| 245 |
0 |
0 |
|a Rewriting Techniques and Applications
|h Elektronische Ressource
|b 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings
|c edited by Vincent van Oostrom
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
| 300 |
|
|
|a X, 315 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Symbolic and Algebraic Manipulation
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b98160
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b98160?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.131
|