|
|
|
|
| LEADER |
02789nam a22005895i 4500 |
| 001 |
7485 |
| 003 |
DE-He213 |
| 005 |
20130725192912.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642037412
|9 978-3-642-03741-2
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-03741-2
|2 doi
|
| 050 |
# |
4 |
|a QA76.9.L63
|
| 050 |
# |
4 |
|a QA76.5913
|
| 050 |
# |
4 |
|a QA76.63
|
| 072 |
# |
7 |
|a UM
|2 bicssc
|
| 072 |
# |
7 |
|a UYF
|2 bicssc
|
| 072 |
# |
7 |
|a COM051000
|2 bisacsh
|
| 072 |
# |
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 100 |
1 |
# |
|a Kurz, Alexander.
|e editor.
|
| 245 |
1 |
0 |
|a Algebra and Coalgebra in Computer Science
|b Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings /
|c edited by Alexander Kurz, Marina Lenisa, Andrzej Tarlecki.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
# |
# |
|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,
|v 5728
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the proceedings of the Third International Conference on Algebra and Coalgebra in Computer Science, CALCO 2009, formed in 2005 by joining CMCS and WADT. This year the conference was held in Udine, Italy, September 7-10, 2009. The 23 full papers were carefully reviewed and selected from 42 submissions. They are presented together with four invited talks and workshop papers from the CALCO-tools Workshop. The conference was divided into the following sessions: algebraic effects and recursive equations, theory of coalgebra, coinduction, bisimulation, stone duality, game theory, graph transformation, and software development techniques.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Logic design.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
# |
0 |
|a Algebra
|x Data processing.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Models and Principles.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 700 |
1 |
# |
|a Lenisa, Marina.
|e editor.
|
| 700 |
1 |
# |
|a Tarlecki, Andrzej.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642037405
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5728
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-03741-2
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|