|
|
|
|
| LEADER |
03261nam a22005415i 4500 |
| 001 |
978-3-540-32425-6 |
| 003 |
DE-He213 |
| 005 |
20151204142910.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100411s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540324256
|9 978-3-540-32425-6
|
| 024 |
7 |
|
|a 10.1007/11601548
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA8.9-QA10.3
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a MAT018000
|2 bisacsh
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.131
|2 23
|
| 245 |
1 |
0 |
|a Processes, Terms and Cycles: Steps on the Road to Infinity
|h [electronic resource] :
|b Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday /
|c edited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a XVIII, 642 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3838
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|
| 700 |
1 |
|
|a Middeldorp, Aart.
|e editor.
|
| 700 |
1 |
|
|a Oostrom, Vincent van.
|e editor.
|
| 700 |
1 |
|
|a Raamsdonk, Femke van.
|e editor.
|
| 700 |
1 |
|
|a Vrijer, Roel de.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540309116
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3838
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11601548
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
