Processes, Terms and Cycles: Steps on the Road to Infinity Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Middeldorp, Aart (Επιμελητής έκδοσης), Oostrom, Vincent van (Επιμελητής έκδοσης), Raamsdonk, Femke van (Επιμελητής έκδοσης), Vrijer, Roel de (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3838
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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.