000 03776nam a22004935i 4500
001 978-3-540-45970-5
003 DE-He213
005 20160624102010.0
007 cr nn 008mamaa
008 121227s1988 gw | s |||| 0|eng d
020 _a9783540459705
_9978-3-540-45970-5
024 7 _a10.1007/3-540-50325-0
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
245 1 0 _aRecent Trends in Data Type Specification
_h[electronic resource] :
_b5th Workshop on Specification of Abstract Data Types Gullane, Scotland, September 1–4, 1987 Selected Papers /
_cedited by D. Sannella, A. Tarlecki.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
300 _aVIII, 268 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 ;
_v332
505 0 _aThe stratified loose approach: A generalization of initial and loose semantics -- Algebraic data type and process specifications based on projection spaces -- Structuring theories on consequence -- Completion with history-dependent complexities for generated equations -- Jungle evaluation -- The ACT-system experiences and future enhancements -- The specification language of OBSCURE -- Algebraic specifications of reachable higher-order algebras -- Observing nondeterministic data types -- Initial behaviour semantics for algebraic specifications -- Partial algebras, subsorting, and dependent types -- Operational semantics of behavioural canons based on narrowing -- The algebraic specification of semicomputable data types.
520 _aThe Fifth Workshop on Specification of Abstract Data Types took place 1-4 September 1987 in Gullane, near Edinburgh. This book contains papers based on selected talks presented at the workshop. The algebraic specification of abstract data types has been a flourishing topic in computer science since 1974. The main goal of work in this area is to evolve a methodology to support the design and formal development of reliable software. The particular approach taken builds upon concepts from universal algebra and elementary category theory. The core of this work has now stabilized to a great extent and is mature enough to find application in real-life software engineering and to related topics such as concurrency, databases, and even hardware design. Such applications are becoming more feasible because of the emergence of integrated specification/development environments which include tools such as theorem provers based on fast term rewriting engines. Researchers are also exploring ways of widening the scope of the theory to make it applicable to (for example) higher-order functions and non-deterministic programs. Another trend is toward taking a more general view which allows superficially different approaches having the same general aims and methods to be unified.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aSannella, D.
_eeditor.
700 1 _aTarlecki, A.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540503255
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v332
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-50325-0
942 _2EBK5648
_cEBK
999 _c34942
_d34942