000 03645nam a22005895i 4500
001 978-3-540-32425-6
003 DE-He213
005 20240423125654.0
007 cr nn 008mamaa
008 100411s2005 gw | s |||| 0|eng d
020 _a9783540324256
_9978-3-540-32425-6
024 7 _a10.1007/11601548
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aProcesses, Terms and Cycles: Steps on the Road to Infinity
_h[electronic resource] :
_bEssays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday /
_cedited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXVIII, 642 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3838
505 0 _aThe 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.
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aMiddeldorp, Aart.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _avan Oostrom, Vincent.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _avan Raamsdonk, Femke.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _ade Vrijer, Roel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540309116
776 0 8 _iPrinted edition:
_z9783540818861
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3838
856 4 0 _uhttps://doi.org/10.1007/11601548
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c180496
_d180496