demonstration

IGOR2 - an analytical inductive functional programming system: tool demo

Author:

Martin HofmannAuthors Info & Claims

PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

Pages 29 - 32

https://doi.org/10.1145/1706356.1706364

Published: 18 January 2010 Publication History

Get Access

Abstract

The analytical inductive programming system IGOR II is an implemented prototype for constructing recursive functional programs from few non-recursive, possibly non-ground example equations describing a subset of the input/output (I/O) behaviour of a function. Starting from an initial, overly general program hypothesis, stepwise several refinement operators are applied which compute successor hypotheses. Organised as an uniformed-cost search, the hypothesis with the lowest costs is developed and replaced by its successors until the best does not contain any unbound variables.

References

[1]

M. Hofmann. I/O Guided Detection of List Catamorphisms -- Towards Problem Specific Use of Program Templates in IP. to appear in ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM'10), 2010.

Digital Library

Google Scholar

[2]

S.P. Jones. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, May 2003. ISBN 0521826144.

Google Scholar

[3]

E. Kitzelmann. Data-driven induction of recursive functions from I/O-examples. In E. Kitzelmann and U. Schmid, editors, Proceedings of the ECML/PKDD 2007 Workshop on Approaches and Applications of Inductive Programming (AAIP'07), pages 15--26, 2007.

Google Scholar

[4]

E. Kitzelmann and U. Schmid. Inductive synthesis of functional programs: An explanation based generalization approach. Journal of Machine Learning Research, 7:429--454, 2006. ISSN 1533-7928.

Digital Library

Google Scholar

[5]

T.M. Mitchell. Machine Learning. McGraw-Hill Higher Education, 1997. ISBN 0070428077.

Digital Library

Google Scholar

[6]

G. Plotkin. A note on inductive generalisation. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 153--163. Edinburgh University Press, Edinburgh, 1969.

Google Scholar

Cited By

View all

Mariano BWang ZPailoor SCollberg CDillig I(2024)Control-Flow Deobfuscation using Trace-Informed Compositional Program SynthesisProceedings of the ACM on Programming Languages10.1145/36897898:OOPSLA2(2211-2241)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689789
Yuan YRadhakrishna ASamanta R(2023)Trace-Guided Inductive Synthesis of Recursive Functional ProgramsProceedings of the ACM on Programming Languages10.1145/35912557:PLDI(860-883)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591255
Correia AIyoda JMota A(2021)A family of multi-concept program synthesisers in Alloy⁎Science of Computer Programming10.1016/j.scico.2020.102536201(102536)Online publication date: Jan-2021
https://doi.org/10.1016/j.scico.2020.102536
Show More Cited By

Index Terms

IGOR2 - an analytical inductive functional programming system: tool demo
1. Computing methodologies
  1. Machine learning
    1. Machine learning approaches
      1. Logical and relational learning
        Inductive logic learning

Recommendations

Probabilistic and Truth-Functional Many-Valued Logic Programming
ISMVL '99: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. ...
Programming inductive proofs: a new approach based on contextual types
Verification, induction termination analysis

In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inference rules within the logical framework LF. It also supports implementing ...
Towards Human-Level Inductive Functional Programming
Proceedings of the 8th International Conference on Artificial General Intelligence - Volume 9205

Inductive programming is the framework for automated programming, obtaining generalized recursive programs from ambiguous specifications such as input-output examples. Development of an inductive programming system at the level of human programmers is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PEPM '10: Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation

January 2010

168 pages

ISBN:9781605587271

DOI:10.1145/1706356

Program Chairs:
John Gallagher
Roskilde University, Denmark, and IMDEA Software, Spain
,
Janis Voigtländer
University of Bonn, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 January 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Demonstration

Conference

PEPM '10

Sponsor:

SIGPLAN

PEPM '10: Partial Evaluation and Program Manipulation

January 18 - 19, 2010

Madrid, Spain

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
172
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mariano BWang ZPailoor SCollberg CDillig I(2024)Control-Flow Deobfuscation using Trace-Informed Compositional Program SynthesisProceedings of the ACM on Programming Languages10.1145/36897898:OOPSLA2(2211-2241)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689789
Yuan YRadhakrishna ASamanta R(2023)Trace-Guided Inductive Synthesis of Recursive Functional ProgramsProceedings of the ACM on Programming Languages10.1145/35912557:PLDI(860-883)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591255
Correia AIyoda JMota A(2021)A family of multi-concept program synthesisers in Alloy⁎Science of Computer Programming10.1016/j.scico.2020.102536201(102536)Online publication date: Jan-2021
https://doi.org/10.1016/j.scico.2020.102536
Krawiec KBłądek ISwan JDrake J(2018)Counterexample-driven genetic programmingProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304652.3304755(5304-5308)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304652.3304755
Bł?dek IKrawiec KSwan J(2018)Counterexample-driven genetic programmingEvolutionary Computation10.1162/evco_a_0022826:3(441-469)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1162/evco_a_00228
Swan JKrawiec K(2018)Discovering Relational Structure in Program Synthesis Problems with Analogical ReasoningGenetic Programming Theory and Practice XIV10.1007/978-3-319-97088-2_10(149-164)Online publication date: 25-Oct-2018
https://doi.org/10.1007/978-3-319-97088-2_10
Krawiec KBłądek ISwan JBosman P(2017)Counterexample-driven genetic programmingProceedings of the Genetic and Evolutionary Computation Conference10.1145/3071178.3071224(953-960)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1145/3071178.3071224
Herrmann MMayer CRadig B(2014)Automatic generation of image analysis programsPattern Recognition and Image Analysis10.1134/S105466181403007924:3(400-408)Online publication date: 1-Sep-2014
https://dl.acm.org/doi/10.1134/S1054661814030079
Kneuss EKuraj IKuncak VSuter P(2013)Synthesis modulo recursive functionsACM SIGPLAN Notices10.1145/2544173.250955548:10(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2544173.2509555
Kneuss EKuraj IKuncak VSuter PHosking AEugster PLopes C(2013)Synthesis modulo recursive functionsProceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications10.1145/2509136.2509555(407-426)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2509136.2509555
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Probabilistic and Truth-Functional Many-Valued Logic Programming

Programming inductive proofs: a new approach based on contextual types

Towards Human-Level Inductive Functional Programming