Atjaunināt sīkdatņu piekrišanu

Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday 2005 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 642 pages, height x width: 233x155 mm, weight: 2020 g, XVIII, 642 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 3838
  • Izdošanas datums: 13-Dec-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 354030911X
  • ISBN-13: 9783540309116
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 91,53 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 107,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 642 pages, height x width: 233x155 mm, weight: 2020 g, XVIII, 642 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 3838
  • Izdošanas datums: 13-Dec-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 354030911X
  • ISBN-13: 9783540309116
Citas grāmatas par šo tēmu:
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. Without attempting to give a balanced account of Jan Willem’s scienti c achievements, we recall three accomplishments from the early years of his career that especially stand out. The ?rst is his counterexample showing that the extension of the lambda calculus with surjective pairing lacks the Church–Rosserproperty,or, in modern terminology, is not con uent [ 7,9]. This settled a famous open problem, which had challenged several researchers in the lambda calculus community for years. The secondis his pioneeringworkintermrewriting.In hisPhDthesis[ 9],Jan Willem gave a systematic study of orthogonal rewriting in the general setting of combinatoryreductionsystems(CRSs),therebyputtingtheareasofhigher-order rewriting and orthogonality ?rmly on the map. Some of the ideas in the thesis trace back to the famous Blue Preprint [ 2], from the period that Jan Willem and some other students were graduating in mathematics and logic, under the supervision of Dirk van Dalen and Henk Barendregt. The third feat is the creation, together with Jan Bergstra [ 23], of the algebra of communicating processes (ACP). With his early work,Jan Willem provided inspiration for many years of fru- ful research, continuing to this day. For decades he has been a creative and stimulating force in the areas of term rewriting and process algebra. Some of his recent interests are in nitary rewriting, graph rewriting and the geometry of processes.
The Spectra of Words.- On the Undecidability of Coherent Logic.- Löbs
Logic Meets the ?-Calculus.- A Characterisation of Weak Bisimulation
Congruence.- Böhms Theorem, Churchs 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.