Rewriting Techniques and Applications (häftad)
Fler böcker inom
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
315
Utgivningsdatum
2004-05-01
Upplaga
2004 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Oostrom, Vincent van (ed.)
Illustrationer
X, 315 p.
Dimensioner
234 x 156 x 18 mm
Vikt
468 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540221531

Du kanske gillar

Rewriting Techniques and Applications (häftad)

Rewriting Techniques and Applications

15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings

av Vincent Van Oostrom
Häftad Engelska, 2004-05-01
981
Köp
Spara som favorit
  • Skickas inom 7-10 vardagar.
  • Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
This volume contains the proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), which was held June 2- 5, 2004, at the RWTH Aachen in Germany. RTA is the major forum for the presentation of research on all aspects of rewriting. Previous RTA conferences took place in Dijon (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), and Valencia (2003). The program committee selected 19 papers for presentation, including ?ve system descriptions, from a total of 43 submissions. In addition, there were invited talks by Neil Jones, Aart Middeldorp, and Robin Milner. Many people helped to make RTA 2004 a success. I am grateful to the m- bers of the program committee and the external referees for reviewing the s- missionsandmaintainingthehighstandardsoftheRTAconferences. Itisagreat pleasure to thank the conference chair Jurgen .. Giesl and the other members of the local organizing committee. They were in charge of the local organization of all events partaking in the Federated Conference on Rewriting, Deduction, and Programming (RDP). Apart from RTA 2004, these events were: - 2nd International Workshop on Higher-Order Rewriting (Delia Kesner, Femke van Raamsdonk, and Joe Wells), - 5th International Workshop on Rule-Based Programming (Slim Abdennadher and Christophe Ringeissen), - 13thInternationalWorkshoponFunctionaland(Constraint)LogicProgr- ming (Herbert Kuchen), - IFIP Working Group 1.
Visa hela texten

Passar bra ihop

  1. Rewriting Techniques and Applications
  2. +
  3. Dopamine Nation

De som köpt den här boken har ofta också köpt Dopamine Nation av Dr Anna Lembke (häftad).

Köp båda 2 för 1119 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Vincent Van Oostrom

  • Logic Colloquium '99

    Logic Colloquium '99

    Jan Van Eijck, Vincent Van Oostrom, Albert Visser

    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. T...

    851
    Ladda ned
    Laddas ned direkt
  • Processes, Terms and Cycles: Steps on the Road to Infinity

    Processes, Terms and Cycles: Steps on the Road to Infinity

    Aart Middeldorp, Vincent Van Oostrom, Femke Van Raamsdonk, Roel De Vrijer

    This Festschrift is dedicated to Jan Willem Klop on the occasion of his 60th birthdayon December 19,2005.Its focus is on the lambda calculus, term rewr- ing and process algebra, the ?elds where Jan Willem has made fundamental contributions. Withou...

    1607
    Köp
    Skickas inom vardagar.

Innehållsförteckning

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.- Boehm-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.