Processes, Terms and Cycles: Steps on the Road to Infinity Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday /
Processes, Terms and Cycles: Steps on the Road to Infinity Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday / [electronic resource] :
edited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer.
- 1st ed. 2005.
- XVIII, 642 p. online resource.
- Theoretical Computer Science and General Issues, 3838 2512-2029 ; .
- Theoretical Computer Science and General Issues, 3838 .
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.
9783540324256
10.1007/11601548 doi
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 Foundations.
QA267-268.5
005.131
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.
9783540324256
10.1007/11601548 doi
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 Foundations.
QA267-268.5
005.131