000 03614nam a22005415i 4500
001 978-3-540-48579-7
003 DE-He213
005 20160624102035.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 _a9783540485797
_9978-3-540-48579-7
024 7 _a10.1007/3-540-58233-9
_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 _aHigher-Order Algebra, Logic, and Term Rewriting
_h[electronic resource] :
_bFirst International Workshop, HOA'93 Amsterdam, The Netherlands, September 23–24, 1993 Selected Papers /
_cedited by Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
300 _aIX, 351 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 ;
_v816
505 0 _aInteraction systems -- Strong normalization of typeable rewrite systems -- A transformation system combining partial evaluation with term rewriting -- Prototyping relational specifications using higher-order objects -- Origin tracking for higher-order term rewriting systems -- Theory interpretation in simple type theory -- The semantics of SPECTRUM -- ATLAS: A typed language for algebraic specification -- Compilation of Combinatory Reduction Systems -- Specification and verification in higher order algebra: A case study of convolution -- Ordered and continuous models of higher-order specifications -- Rewriting properties of combinators for rudimentary linear logic -- Comparing combinatory reduction systems and higher-order rewrite systems -- Termination proofs for higher-order rewrite systems -- Extensions of initial models and their second-order proof systems.
520 _aThis volume contains the final revised versions of the best papers presented at the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting (HOA '93), held in Amsterdam in September 1993. Higher-Order methods are increasingly applied in functional and logic programming languages, as well as in specification and verification of programs and hardware. The 15 full papers in this volume are devoted to the algebra and model theory of higher-order languages, computational logic techniques including resolution and term rewriting, and specification and verification case studies; in total they provide a competently written overview of current research and suggest new research directions in this vigourous area.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aHeering, Jan.
_eeditor.
700 1 _aMeinke, Karl.
_eeditor.
700 1 _aMöller, Bernhard.
_eeditor.
700 1 _aNipkow, Tobias.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540582335
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v816
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-58233-9
942 _2EBK6524
_cEBK
999 _c35818
_d35818