Mathematical Methods of Specification and Synthesis of Software Systems '85 [electronic resource] : Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22–26, 1985 / edited by Wolfgang Bibel, Klaus P. Jantke.

Contributor(s): Bibel, Wolfgang [editor.] | Jantke, Klaus P [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 215Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: 249 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540397847Subject(s): Computer science | Computer Science | Programming TechniquesAdditional physical formats: Printed edition:: No titleDDC classification: 005.11 LOC classification: QA76.6-76.66Online resources: Click here to access online
Contents:
Verification 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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4714

Verification 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha