|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-73449-9 |
| 003 |
DE-He213 |
| 005 |
20230221020934.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540734499
|9 978-3-540-73449-9
|
| 024 |
7 |
|
|a 10.1007/978-3-540-73449-9
|2 doi
|
| 050 |
|
4 |
|a QA76.76.C65
|
| 072 |
|
7 |
|a UMC
|2 bicssc
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a UMC
|2 thema
|
| 082 |
0 |
4 |
|a 005.45
|2 23
|
| 245 |
1 |
0 |
|a Term Rewriting and Applications
|h [electronic resource] :
|b 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings /
|c edited by Franz Baader.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XII, 422 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4533
|
| 505 |
0 |
|
|a Formal Verification of an Optimizing Compiler -- Challenges in Satisfiability Modulo Theories -- On a Logical Foundation for Explicit Substitutions -- Intruders with Caps -- Tom: Piggybacking Rewriting on Java -- Rewriting Approximations for Fast Prototyping of Static Analyzers -- Determining Unify-Stable Presentations -- Confluence of Pattern-Based Calculi -- A Simple Proof That Super-Consistency Implies Cut Elimination -- Bottom-Up Rewriting Is Inverse Recognizability Preserving -- Adjunction for Garbage Collection with Application to Graph Rewriting -- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers -- Symbolic Model Checking of Infinite-State Systems Using Narrowing -- Delayed Substitutions -- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems -- Termination of Rewriting with Right-Flat Rules -- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations -- On the Completeness of Context-Sensitive Order-Sorted Specifications -- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis -- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi -- Proving Termination of Rewrite Systems Using Bounds -- Sequence Unification Through Currying -- The Termination Competition -- Random Descent -- Correctness of Copy in Calculi with Letrec -- A Characterization of Medial as Rewriting Rule -- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus -- On Linear Combinations of ?-Terms -- Satisfying KBO Constraints -- Termination by Quasi-periodic Interpretations.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
1 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 700 |
1 |
|
|a Baader, Franz.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540840497
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540734475
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4533
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-73449-9
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
