Inductive synthesis of functional programs
Autor(en): | Kitzelmann, E. Schmid, U. Mühlpfordt, M. Wysotzki, F. |
Herausgeber: | Henocque, L. Calmet, J. Benhamou, B. Caprotti, O. Sorge, V. |
Stichwörter: | Computer science; Computers, Folding; Folding; Functional programs; Inductive program synthesis; Language independents; Recurrence relations; Recursive equations; Recursive program schemes; Variable substitution, Artificial intelligence | Erscheinungsdatum: | 2002 | Herausgeber: | Springer Verlag | Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Volumen: | 2385 | Startseite: | 26 | Seitenende: | 37 | Zusammenfassung: | We present an approach to folding of finite program terms based on the detection of recurrence relations in a single given term which is considered as the kth unfolding of an unknown recursive program. Our approach goes beyond Summers' classical approach in several aspects: It is language independent and works for terms belonging to an arbitrary term algebra; it allows induction of sets of recursive equations which are in some arbitrary ‘calls' relation; induced equations can be dependent on more than one input parameters and we can detect interdependencies of variable substitutions in recursive calls; the given input terms can represent incomplete unfoldings of an hypothetical recursive program. © Springer-Verlag Berlin Heidelberg 2002. |
Beschreibung: | Conference of Joint Conferences on 6th Artificial Intelligence and Symbolic Computation, AISC 2002 and 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2002 ; Conference Date: 1 July 2002 Through 5 July 2002; Conference Code:128289 |
ISBN: | 9783540438656 | ISSN: | 03029743 | DOI: | 10.1007/3-540-45470-5 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84957041096&doi=10.1007%2f3-540-45470-5&partnerID=40&md5=b477aec4b5833b1b00dd4a58b404e057 |
Show full item record