000 04028nam a22005175i 4500
001 978-3-540-46116-6
003 DE-He213
005 20160624102011.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540461166
_9978-3-540-46116-6
024 7 _a10.1007/3-540-50939-9
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aTAPSOFT '89
_h[electronic resource] :
_bProceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13–17, 1989 /
_cedited by Josep Díaz, Fernando Orejas.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aXII, 383 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 ;
_v351
505 0 _aThe varieties of programming language -- Independence of negative constraints -- Completion procedures as transition rules + control -- A modular framework for specification and implementation -- On the existence of initial models for partial (higher-order) conditional specifications -- Terms and infinite trees as monads over a signature -- The subsequence graph of a text -- Syntactical properties of unbounded nets of processors -- Shuffle equations, parallel transition systems and equational Petri nets -- Towards a lambda-calculus for concurrent and communicating systems -- A distributed, net oriented semantics for Delta Prolog -- Continuation semantics for PROLOG with cut -- Labeled trees and relations on generating functions -- Proofs of declarative properties of logic programs -- The reachability problem for ground TRS and some extensions -- Order-sorted completion: The many-sorted way -- Algebraization and integrity constraints for an extended entity-relationship approach -- Decidable boundedness problems for hyperedge-replacement graph grammars -- Implementation of parameterized observational specifications -- Priority controlled incremental attribute evaluation in attributed graph grammars -- Some applications and techniques for generating functions -- Semi-constructive formal systems and axiomatization of abstract data types -- Inductive proofs by resolution and paramodulation -- Local model checking in the modal mu-calculus.
520 _aTAPSOFT '89 is the Third International Joint Conference on Theory and Practice of Software Development held in Barcelona, Spain, March 13-17, 1989. The conference consisted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP '89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT '89 Conference Proceedings are published in two volumes. The first volume includes the papers from CAAP plus the more theoretical ones of the invited papers. The second volume comprises the papers from CCIPL and the invited papers more relevant to current issues in programming languages.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aDíaz, Josep.
_eeditor.
700 1 _aOrejas, Fernando.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540509394
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v351
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-50939-9
942 _2EBK5699
_cEBK
999 _c34993
_d34993