Cantitate/Preț
Produs

Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday: Lecture Notes in Computer Science, cartea 3838

Editat de Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer
en Limba Engleză Paperback – 13 dec 2005

Din seria Lecture Notes in Computer Science

Preț: 66361 lei

Preț vechi: 82951 lei
-20% Nou

Puncte Express: 995

Preț estimativ în valută:
12699 13178$ 10615£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540309116
ISBN-10: 354030911X
Pagini: 660
Ilustrații: XVIII, 642 p.
Dimensiuni: 155 x 233 x 35 mm
Greutate: 0.92 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

The Spectra of Words.- On the Undecidability of Coherent Logic.- Löb’s Logic Meets the ?-Calculus.- A Characterisation of Weak Bisimulation Congruence.- Böhm’s Theorem, Church’s Delta, Numeral Systems, and Ershov Morphisms.- Explaining Constraint Programming.- Sharing in the Weak Lambda-Calculus.- Term Rewriting Meets Aspect-Oriented Programming.- Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes.- Primitive Rewriting.- Infinitary Rewriting: From Syntax to Semantics.- Reducing Right-Hand Sides for Termination.- Reduction Strategies for Left-Linear Term Rewriting Systems.- Higher-Order Rewriting: Framework, Confluence and Termination.- Timing the Untimed: Terminating Successfully While Being Conservative.- Confluence of Graph Transformation Revisited.- Compositional Reasoning for Probabilistic Finite-State Behaviors.- Finite Equational Bases in Process Algebra: Results and Open Questions.- Skew and ?-Skew Confluence and Abstract Böhm Semantics.- A Mobility Calculus with Local and Dependent Types.- Model Theory for Process Algebra.- Expression Reduction Systems and Extensions: An Overview.- Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.