000 | 01750nam a22004455i 4500 | ||
---|---|---|---|
001 | 978-3-540-39256-9 | ||
003 | DE-He213 | ||
005 | 20160624101943.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1980 gw | s |||| 0|eng d | ||
020 |
_a9783540392569 _9978-3-540-39256-9 |
||
024 | 7 |
_a10.1007/3-540-09987-5 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 |
_aSanderson, John G. _eauthor. |
|
245 | 1 | 2 |
_aA Relational Theory of Computing _h[electronic resource] / _cby John G. Sanderson. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1980. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1980. |
|
300 |
_aVI, 147 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v82 |
|
505 | 0 | _aThe components of a relational calculus -- A comparison of some relational calculi -- Properties of relators -- The extension of a calculus -- Types and structures -- Programs -- Assignment and efficiency -- Metatheory -- Conclusions. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540099871 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v82 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-09987-5 |
942 |
_2EBK4614 _cEBK |
||
999 |
_c33908 _d33908 |