Central Library

Normal view MARC view ISBD view

Processes, Terms and Cycles: Steps on the Road to Infinity [electronic resource] : Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday / edited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer.

Contributor(s): Middeldorp, Aart [editor.] | van Oostrom, Vincent [editor.] | van Raamsdonk, Femke [editor.] | de Vrijer, Roel [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 3838Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005Edition: 1st ed. 2005.Description: XVIII, 642 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540324256.Subject(s): Machine theory | Computer science | Artificial intelligence | Mathematical logic | Formal Languages and Automata Theory | Computer Science Logic and Foundations of Programming | Artificial Intelligence | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.131 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.