Skip to main content
  • Book
  • © 2003

Inductive Synthesis of Functional Programs

Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning

Authors:

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2654)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (13 chapters)

  1. Front Matter

  2. 1. Introduction

    1. 1. Introduction

      • Ute Schmid
      Pages 1-10
  3. Part I. Planning

    1. Front Matter

      Pages 11-11
    2. 2. State-Based Planning

      • Ute Schmid
      Pages 13-54
    3. 5. Conclusions and Further Research

      • Ute Schmid
      Pages 93-96
  4. Part II. Inductive Program Synthesis

    1. Front Matter

      Pages 97-97
    2. 6. Automatic Programming

      • Ute Schmid
      Pages 99-166
    3. 7. Folding of Finite Program Terms

      • Ute Schmid
      Pages 167-225
    4. 9. Conclusions and Further Research

      • Ute Schmid
      Pages 271-275
  5. Part III. Schema Abstraction

    1. Front Matter

      Pages 277-277
    2. 12. Programming by Analogy

      • Ute Schmid
      Pages 311-321
    3. 13. Conclusions and Further Research

      • Ute Schmid
      Pages 323-325
  6. Back Matter

About this book

Because of its promise to support human programmers in developing correct and efficient program code and in reasoning about programs, automatic program synthesis has attracted the attention of researchers and professionals since the 1970s.

This book focusses on inductive program synthesis, and especially on the induction of recursive functions; it is organized into three parts on planning, inductive program synthesis, and analogical problem solving and learning. Besides methodological issues in inductive program synthesis, emphasis is placed on its applications to control rule learning for planning. Furthermore, relations to problem solving and learning in cognitive psychology are discussed.

Authors and Affiliations

  • Institute of Computer Science Department of Mathematics and Computer Science, University of Osnabrück, Osnabrück, Germany

    Ute Schmid

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access