| 000 | 05407nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-32033-3 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125556.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100928s2005 gw | s |||| 0|eng d | ||
| 020 |
_a9783540320333 _9978-3-540-32033-3 |
||
| 024 | 7 |
_a10.1007/b135673 _2doi |
|
| 050 | 4 | _aQA267-268.5 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 245 | 1 | 0 |
_aTerm Rewriting and Applications _h[electronic resource] : _b16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings / _cedited by Jürgen Giesl. |
| 250 | _a1st ed. 2005. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
| 300 |
_aXIII, 517 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3467 |
|
| 505 | 0 | _aConfluent Term Rewriting Systems -- Generalized Innermost Rewriting -- Orderings for Innermost Termination -- Leanest Quasi-orderings -- Abstract Modularity -- Union of Equational Theories: An Algebraic Approach -- Equivariant Unification -- Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories -- Unification in a Class of Permutative Theories -- Dependency Pairs for Simply Typed Term Rewriting -- Universal Algebra for Termination of Higher-Order Rewriting -- Quasi-interpretations and Small Space Bounds -- A Sufficient Completeness Reasoning Tool for Partial Specifications -- Tyrolean Termination Tool -- Call-by-Value Is Dual to Call-by-Name – Reloaded -- ??-Calculus and Duality: Call-by-Name and Call-by-Value -- Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics -- Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete -- Localized Fairness: A Rewriting Semantics -- Partial Inversion of Constructor Term Rewriting Systems -- Natural Narrowing for General Term Rewriting Systems -- The Finite Variant Property: How to Get Rid of Some Algebraic Properties -- Intruder Deduction for AC-Like Equational Theories with Homomorphisms -- Proving Positive Almost-Sure Termination -- Termination of Single-Threaded One-Rule Semi-Thue Systems -- On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems -- Twenty Years Later -- Open. Closed. Open. -- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code -- Extending the Explicit Substitution Paradigm -- Arithmetic as a Theory Modulo -- Infinitary Combinatory Reduction Systems -- Proof-Producing Congruence Closure -- The Algebra of Equality Proofs -- On Computing Reachability Sets of Process Rewrite Systems -- Automata andLogics for Unranked and Unordered Trees. | |
| 520 | _aThis volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005),whichwasheldonApril19– 21, 2005, at the Nara-Ken New Public Hall in the center of the Nara National Park in Nara, Japan. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), and Aachen (2004). This year, there were 79 submissions from 20 countries, of which 31 papers were accepted for publication (29 regular papers and 2 system descriptions). The submissions came from France (10 accepted papers of the 23.1 submitted papers), USA (5.6 of 11.7), Japan (4 of 9), Spain (2.7 of 6.5), UK (2.7 of 4.7), The Netherlands (1.7 of 3.8), Germany (1.3 of 2.3), Austria (1 of 1), Poland (1 of 1), Israel (0.5 of 0.8), Denmark (0.5 of 0.5), China (0 of 4), Korea (0 of 4), Taiwan (0 of 1.3), Australia (0 of 1), Brazil (0 of 1), Russia (0 of 1), Switzerland (0 of 1), Sweden (0 of 1), and Italy (0 of 0.3). Each submission was assigned to at least three Program Committee m- bers, who carefully reviewed the papers, with the help of 111 external referees. | ||
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 1 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
| 700 | 1 |
_aGiesl, Jürgen. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540255963 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540809982 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3467 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/b135673 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c179457 _d179457 |
||