Editing Program synthesis (section)

== Origin ==
During the Summer Institute of Symbolic Logic at Cornell University in 1957, [[Alonzo Church]] defined the problem to synthesize a circuit from mathematical requirements.<ref>{{cite journal| author=Alonzo Church| title=Applications of recursive arithmetic to the problem of circuit synthesis| journal=Summaries of the Summer Institute of Symbolic Logic|date=1957| volume=1| pages=3–50}}</ref> Even though the work only refers to circuits and not programs, the work is considered to be one of the earliest descriptions of program synthesis and some researchers refer to program synthesis as "Church's Problem". In the 1960s, a similar idea for an "automatic programmer" was explored by researchers in artificial intelligence.{{Citation needed|date=June 2010}}

Since then, various research communities considered the problem of program synthesis. Notable works include the 1969 automata-theoretic approach by [[Julius Richard Büchi|Büchi]] and [[Lawrence Landweber|Landweber]],<ref>{{cite journal| author=Richard Büchi, Lawrence Landweber| title=Solving Sequential Conditions by Finite-State Strategies| journal=Transactions of the American Mathematical Society|date=Apr 1969| volume=138| pages=295–311| doi=10.2307/1994916| url=http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1087&context=cstech| jstor=1994916| url-access=subscription}}</ref> and the works by [[Zohar Manna|Manna]] and [[Richard Waldinger|Waldinger]] (c. 1980). The development of modern [[high-level programming language]]s can also be understood as a form of program synthesis.