000 02957nam a22004455i 4500
001 978-3-540-39784-7
003 DE-He213
005 20160624101945.0
007 cr nn 008mamaa
008 100729s1986 gw | s |||| 0|eng d
020 _a9783540397847
_9978-3-540-39784-7
024 7 _a10.1007/3-540-16444-8
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
082 0 4 _a005.11
_223
245 1 0 _aMathematical Methods of Specification and Synthesis of Software Systems '85
_h[electronic resource] :
_bProceedings of the International Spring School Wendisch-Rietz, GDR, April 22–26, 1985 /
_cedited by Wolfgang Bibel, Klaus P. Jantke.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
300 _a249 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 ;
_v215
505 0 _aVerification of an alternating bit protocol by means of process algebra protocol -- Predicative programming revisited -- Some problems on inductive inference from positive data -- Language and example of knowledge-based programming -- Inductive inference hierarchies: Probabilistic VS pluralistic strategies -- Natural mathematical texts VS. programs -- An algebraic framework for inductive program synthesis -- Approximation logic -- Learning on the basis of a polynomial pattern synthesis algorithm -- The proof-checking component for the pleats programming system enabling specification of theories -- The METANET. A knowledge representation tool based on abstract data types -- One more property of array languages -- Theoretical aspects of ?-programming -- Decidability in pratt's process logics -- A program synthesis algorithm exemplified -- The algorithmic specification method of abstract data types: An overview -- Orientation problems on sequences by recursive functions -- The solution of discrete problems by means of ternary representations -- Formalizing analogical reasoning -- Some results in the theory of effective program synthesis: Learning by defective information -- Deductive normal forms of relations -- How fast is program synthesis from examples -- On recursive optimizers.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Techniques.
700 1 _aBibel, Wolfgang.
_eeditor.
700 1 _aJantke, Klaus P.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540164449
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v215
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-16444-8
942 _2EBK4714
_cEBK
999 _c34008
_d34008