LEADER 03977nam  22006975  450 
001 996465541503316
005 20230406053049.0
010   $a3-540-32425-9
024 7 $a10.1007/11601548
035   $a(CKB)1000000000213566
035   $a(SSID)ssj0000319589
035   $a(PQKBManifestationID)11230373
035   $a(PQKBTitleCode)TC0000319589
035   $a(PQKBWorkID)10338217
035   $a(PQKB)10304820
035   $a(DE-He213)978-3-540-32425-6
035   $a(MiAaPQ)EBC3067872
035   $a(PPN)123099021
035   $a(EXLCZ)991000000000213566
100   $a20100411d2005      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aProcesses, Terms and Cycles: Steps on the Road to Infinity$b[electronic resource] $eEssays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday /$fedited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (XVIII, 642 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3838
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-30911-X 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3838
606   $aMachine theory
606   $aComputer science
606   $aArtificial intelligence
606   $aMathematical logic
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
606   $aArtificial Intelligence
606   $aMathematical Logic and Foundations
615  0$aMachine theory.
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aMathematical logic.
615 14$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Foundations.
676   $a005.131
702   $aMiddeldorp$b Aart$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $avan Oostrom$b Vincent$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $avan Raamsdonk$b Femke$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $ade Vrijer$b Roel$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 02$aSpringerLink (Online service)
906   $aBOOK
912   $a996465541503316
996   $aProcesses, Terms and Cycles: Steps on the Road to Infinity$9772136
997   $aUNISA