Term Rewriting and Applications (Record no. 91199)

000 -LEADER
fixed length control field 05487nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-540-32033-3
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730182037.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100928s2005 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540320333
-- 978-3-540-32033-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/b135673
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267-268.5
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
Edition number 23
245 10 - TITLE STATEMENT
Title Term Rewriting and Applications
Medium [electronic resource] :
Remainder of title 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings /
Statement of responsibility, etc. edited by Jürgen Giesl.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2005.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2005.
300 ## - PHYSICAL DESCRIPTION
Extent XIII, 517 p.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 3467
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Confluent 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 ## - SUMMARY, ETC.
Summary, etc. This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Machine theory.
9 (RLIN) 127047
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
9 (RLIN) 9832
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Compilers (Computer programs).
9 (RLIN) 3350
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence.
9 (RLIN) 3407
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Formal Languages and Automata Theory.
9 (RLIN) 127048
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science Logic and Foundations of Programming.
9 (RLIN) 42203
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Compilers and Interpreters.
9 (RLIN) 31853
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial Intelligence.
9 (RLIN) 3407
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Symbolic and Algebraic Manipulation.
9 (RLIN) 55589
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Giesl, Jürgen.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 127049
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 127050
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540255963
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540809982
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 3467
9 (RLIN) 127051
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/b135673">https://doi.org/10.1007/b135673</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.