Vai al contenuto principale della pagina

Processes, terms and cycles : steps on the road to infinity : essays dedicated to Jan Willem Klop on the occasion of his 60th birthday / / Aart Middeldorp ... [et al.] (eds.)



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Processes, terms and cycles : steps on the road to infinity : essays dedicated to Jan Willem Klop on the occasion of his 60th birthday / / Aart Middeldorp ... [et al.] (eds.) Visualizza cluster
Pubblicazione: Berlin, : Springer-Verlag, c2005
Edizione: 1st ed. 2005.
Descrizione fisica: 1 online resource (XVIII, 642 p.)
Disciplina: 005.131
Soggetto topico: Lambda calculus
Rewriting systems (Computer science)
Machine theory
Altri autori: MiddeldorpAart <1963->  
KlopJ. W  
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Sommario/riassunto: 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.
Titolo autorizzato: Processes, terms and cycles  Visualizza cluster
ISBN: 3-540-32425-9
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910483407303321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Lecture notes in computer science ; ; 3838.