Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Pacific Rim International Conference on Artificial Intelligence

• Publication date

  2008-12-15

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-89197-0_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Data-Driven Induction of Recursive Functions from Input/Output-Examples

  2007influential reference
• Algebras for combinatorial search

  2006cited by this paper
• Library for systematic search for expressions

  2006influential reference
• Systematic search for lambda expressions

  2005influential reference
• Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation

  2004influential reference
• PRICAI 2004: Trends in Artificial Intelligence

  2004cited by this paper
• Inductive Synthesis of Functional Programs

  2003cited by this paper
• Polymorphism and Genetic Programming

  2001influential reference
• Combinators for breadth-first search

  2000cited by this paper
• QuickCheck: a lightweight tool for random testing of Haskell programs

  2000influential reference
• Inductive Functional Programming Using Incremental Program Transformation

  1995influential reference
• Contraction-free sequent calculi for intuitionistic logic

  1992influential reference
• Bounds for cut elimination in intuitionistic propositional logic

  1992cited by this paper

• Example-Based Reasoning about the Realizability of Polymorphic Programs

  2024cites this paper
• Relational decomposition for program synthesis

  2024cites this paper
• Enumerating Valid Non-Alpha-Equivalent Programs for Interpreter Testing

  2024cites this paper
• Can humans teach machines to code?

  2024cites this paper
• Detecting Interpreter Bugs via Filling Function Calls in Skeletal Program Enumeration

  2023cites this paper
• Program Synthesis Using Example Propagation

  2022cites this paper
• Programmatic Policy Extraction by Iterative Local Search

  2022cites this paper
• Express: applications of dynamically typed Haskell expressions

  2021cites this paper
• The Composability of Intermediate Values in Composable Inductive Programming

  2021cites this paper
• Code building genetic programming

  2020cites this paper
• Zoea - Composable Inductive Programming Without Limits

  2019cites this paper
• Learning higher-order logic programs

  2019cites this paper
• CSCI 699 : Introduction to Software Synthesis Units : 4 Fall 2017 – Monday , Wednesday — 10 : 00 am – 11 : 50 am Location : WPH 603 Instructor :

  2017cites this paper
• On the difficulty of benchmarking inductive program synthesis methods

  2017cites this paper
• Automated synthesis of data extraction and transformation programs

  2017cites this paper
• Ideas for a Reinforcement Learning Algorithm that Learns Programs

  2016cites this paper
• Learning Higher-Order Logic Programs through Abstraction and Invention

  2016cites this paper
• Skeletal program enumeration for rigorous compiler testing

  2016cites this paper
• Synthesizing transformations on hierarchically structured data

  2016cites this paper
• Inductive programming meets the real world

  2015influential citation
• Program Synthesis Without Full Specifications for Novel Applications

  2015cites this paper
• Synthesizing data structure transformations from input-output examples

  2015cites this paper
• General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases

  2015cites this paper
• Towards Human-Level Inductive Functional Programming

  2015cites this paper
• Inductive Programming Meets the Real World

  2015cites this paper
• Test-driven synthesis

  2014influential citation
• Deep Knowledge : Inductive Programming as an Answer

  2013cites this paper
• Proceedings of AAIP 2011 - 4th International Workshop on Approaches and Applications of Inductive Programming, Odense, Denmark, July 19, 2011

  2011cites this paper
• 4th International Workshop on Approaches and Applications of Inductive Programming

  2011cites this paper
• Recent Improvements of MagicHaskeller

  2009cites this paper
• Porting IgorII from Maude to Haskell

  2009cites this paper
• Quick filtration of semantically equivalent expressions in program search results

  2009cites this paper
• Porting IgorII from M AUDE to H ASKELL Introducing a System ’ s Design

  2009cites this paper
• Deriving a Relationship from a Single Example

  2009cites this paper
• Exhaustive program generation by interpretation of Herbelin ’ s LJT variant

  2009cites this paper
• Synthesis of Functions Using Generic Programming

  2009cites this paper
• AAIP 2009 Proceedings of the ACM SIGPLAN Workshop on Approaches and Applications of Inductive Programming

  2009cites this paper