| 000 | 04631nam a22004455i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-38194-5 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101939.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100806s1980 gw | s |||| 0|eng d | ||
| 020 |
_a9783540381945 _9978-3-540-38194-5 |
||
| 024 | 7 |
_a10.1007/BFb0022491 _2doi |
|
| 050 | 4 | _aQA8.9-QA10.3 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aMAT018000 _2bisacsh |
|
| 072 | 7 |
_aCOM051010 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 245 | 1 | 0 |
_aMathematical Foundations of Computer Science 1980 _h[electronic resource] : _bProceedings of the 9th Symposium Held in Rydzyna, Poland, September 1–5, 1980 / _cedited by P. Dembiński. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1980. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1980. |
|
| 300 |
_aVIII, 726 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 ; _v88 |
|
| 505 | 0 | _aFormal description of programming concepts -- Electronic category theory -- An essay about research on sparse NP complete sets -- Some theoretical aspects of applicative multiprocessing -- On some discrete optimization problems in mass storage systems -- Abstract data types: A retrospective and prospective view -- Controlling behaviours of systems : Some basic concepts and some applications -- Conceptual relations between databases transformed under join and projection -- The weighted Sperner's Set problem -- Proof of a concurrent program finding Euler paths -- A theoretical basis for the systematic proof method -- Consistent semantics for a data flow language -- Analog processes -- An extended polymorphic type system for applicative languages -- A criterion of undecidability of algorithmic theories -- On finding the optimal access path to resolve a relational data base query -- Compound algebraic implementations: An approach to stepwise refinement of software systems -- On and/or schemes -- A term model for CCS -- A mathematical approach to multi-pass parsing -- Abstract implementation of abstract data types -- Parallel algorithms in graph theory: Planarity testing (preliminary version) -- On atomic nets and concurrency relations -- Node-label controlled graph grammars (Extended abstract) -- A method to compare the descriptive power of different types of Petrinets -- A simple class of algorithmic specifications for abstract software modules -- Inducing patterns of behaviour in distributed system parts -- Van wijngaarden grammars as a special information processing model -- Approaches to concurrency in B-trees -- On a subclass of pseudopolynomial problems -- Decidability of reachability in persistent vector replacement systems -- Generalized heapsort -- Decidability results on a query language for data bases with incomplete information -- New results on completeness and consistency of abstract data types -- Asymptotic complexity of game-searching procedures -- Completeness in classical logic of complex algorithms -- Initially — Restricting algebraic theories -- Schemes for nonsequential processing systems -- Dynamic algebras which are not Kripke structures -- Time and space bounds in producing certain partial orders -- Axioms of algorithmic logic univocally determine semantics of programs -- A logical approach to the problem “P=NP?” -- Verifying concurrent system specifications in COSY -- Deadlocks and livelocks in transition systems -- Descriptional complexity of concurrent processes (preliminary version) -- A uniform approach to applicative and imperative features in programming languages -- A resource allocation problem -- An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem -- Decision complexity of variants of propositional dynamic logic -- Relativized obliviousness -- Abstract data types as lattices of finitely generated models -- The LR(k) parser -- Substitution systems — A family of system models based on concurrency. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 700 | 1 |
_aDembiński, P. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540100270 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v88 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0022491 |
| 942 |
_2EBK4461 _cEBK |
||
| 999 |
_c33755 _d33755 |
||