Processes, terms and cycles: steps on the road to infinity
Autoři
Parametry
Více o knize
InhaltsverzeichnisThe 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.
Nákup knihy
Processes, terms and cycles: steps on the road to infinity, Aart Middeldorp
- Jazyk
- Rok vydání
- 2005
Doručení
Platební metody
2021 2022 2023
Navrhnout úpravu
- Titul
- Processes, terms and cycles: steps on the road to infinity
- Jazyk
- anglicky
- Autoři
- Aart Middeldorp
- Vydavatel
- Springer
- Rok vydání
- 2005
- ISBN10
- 354030911X
- ISBN13
- 9783540309116
- Série
- Lecture notes in computer science
- Kategorie
- Matematika
- Anotace
- InhaltsverzeichnisThe 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.