http://www.bibsonomy.org/group/ipBibSonomy RSS Feed for /group/ipPhD thesis of Moshe Lookshttp://www.bibsonomy.org/bibtex/264d5a8c55e5ca0a625473682f2671ee9/emanuelemanuel2008-11-19T11:49:32+01:00program_synthesis inductive_programming program_evolution experiment induction moses enumerative_ip cognition <span style="color:#555555;">Moshe <a href="http://www.bibsonomy.org/author/Looks">Looks</a> </span>(<em>2006</em>) <a href="http://www.bibsonomy.org/bibtex/264d5a8c55e5ca0a625473682f2671ee9/emanuel"><i>Competent Program Evolution.</i></a> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_evolution">program_evolution</a> <a href="http://www.bibsonomy.org/user/emanuel/experiment">experiment</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/moses">moses</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/cognition">cognition</a>] <a href="http://metacog.org/doc.html">URL</a>Scalable estimation-of-distribution program evolutionhttp://www.bibsonomy.org/bibtex/274540b9c176853d3dc1fca66bdd0e3ad/emanuelemanuel2008-11-19T11:41:48+01:00program_synthesis inductive_programming program_evolution machine_learning induction moses enumerative_ip cognition <span style="color:#555555;">Moshe <a href="http://www.bibsonomy.org/author/Looks">Looks</a> </span>(<em>2007</em>) <a href="http://www.bibsonomy.org/bibtex/274540b9c176853d3dc1fca66bdd0e3ad/emanuel"><i>Scalable Estimation-of-Distribution Program Evolution.</i></a><em>Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO'07), </em><em>Seite539--546. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_evolution">program_evolution</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/moses">moses</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/cognition">cognition</a>] <a href="http://doi.acm.org/10.1145/1276958.1277072">URL</a>http://www.bibsonomy.org/bibtex/220e34387d9a94de9248566ca8fcd11c9/emanuelemanuel2008-11-19T11:09:44+01:00program_synthesis inductive_programming functional_programming program_transformation induction ifp nlp enumerative_ip adate olsson <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Olsson">Olsson</a> und D. M. W. <a href="http://www.bibsonomy.org/author/Powers">Powers</a> </span>(<em>2003</em>) <a href="http://www.bibsonomy.org/bibtex/220e34387d9a94de9248566ca8fcd11c9/emanuel"><i>Machine Learning of Human Language through Automatic Programming.</i></a><em>Proceedings of the International Conference on Cognitive Science, </em><em>Seite507--512. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/functional_programming">functional_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/nlp">nlp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/adate">adate</a> <a href="http://www.bibsonomy.org/user/emanuel/olsson">olsson</a>] <a href="http://www-ia.hiof.no/~rolando/">URL</a>http://www.bibsonomy.org/bibtex/29f5787ec20bc9f3467295a59487e1070/emanuelemanuel2008-11-19T11:00:27+01:00program_synthesis inductive_programming functional_programming program_transformation induction ifp enumerative_ip adate olsson <span style="color:#555555;">J. <a href="http://www.bibsonomy.org/author/Roland Olsson">Roland Olsson</a> </span>(<em>1999</em>) <a href="http://www.bibsonomy.org/bibtex/29f5787ec20bc9f3467295a59487e1070/emanuel"><i>How to Invent Functions.</i></a><em>Proceedings of the European Workshop on Genetic Programming (EuroGP'99), </em><em>Seite232--243. </em><em>Berlin, Germany, </em><em>Springer-Verlag, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/functional_programming">functional_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/adate">adate</a> <a href="http://www.bibsonomy.org/user/emanuel/olsson">olsson</a>] <a href="http://dx.doi.org/10.1007/3-540-48885-5_20">URL</a>http://www.bibsonomy.org/bibtex/20cb4c99c93fffd491c4fb92d4ec5faa0/emanuelemanuel2008-11-19T10:52:08+01:00program_synthesis inductive_programming functional_programming program_transformation induction ifp enumerative_ip adate olsson <span style="color:#555555;">J. <a href="http://www.bibsonomy.org/author/Roland Olsson">Roland Olsson</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/20cb4c99c93fffd491c4fb92d4ec5faa0/emanuel"><i>The Art of Writing Specifications for the ADATE Automatic Programming System.</i></a><em>Proceedings of the Annual Genetic Programming Conference, </em><em>Seite278--283. </em><em>San Francisco, CA, USA, </em><em>Morgan Kaufmann, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/functional_programming">functional_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/adate">adate</a> <a href="http://www.bibsonomy.org/user/emanuel/olsson">olsson</a>] <a href="http://www-ia.hiof.no/~rolando/">URL</a>http://www.bibsonomy.org/bibtex/2a9c103808837480e84c1e9a87d8a0010/emanuelemanuel2008-11-19T10:42:43+01:00program_synthesis program_optimisation inductive_programming functional_programming program_transformation induction ifp enumerative_ip adate olsson <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Olsson">Olsson</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/2a9c103808837480e84c1e9a87d8a0010/emanuel"><i>Population Management for Automatic Design of Algorithms through Evolution.</i></a><em>Proceedings of the International Conference on Evolutionary Computation, </em><em>Seite592--597. </em><em>IEEE Press, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/program_optimisation">program_optimisation</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/functional_programming">functional_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/adate">adate</a> <a href="http://www.bibsonomy.org/user/emanuel/olsson">olsson</a>] <a href="http://www-ia.hiof.no/~rolando/">URL</a>http://www.bibsonomy.org/bibtex/2d00e97cbb42d9828cc14bbe906e992b0/emanuelemanuel2008-10-02T22:33:10+02:00semantics recursive_program_schemes <span style="color:#555555;">Bruno <a href="http://www.bibsonomy.org/author/Courcelle">Courcelle</a> </span>(<em>1990</em>) <a href="http://www.bibsonomy.org/bibtex/2d00e97cbb42d9828cc14bbe906e992b0/emanuel"><i>Recursive Applicative Program Schemes.</i></a><em>Handbook of Theoretical Computer Science: Formal Models and Semantics, </em><em>Seite459--492. </em><em>Cambridge, MA, USA, </em><em>MIT Press, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/semantics">semantics</a> <a href="http://www.bibsonomy.org/user/emanuel/recursive_program_schemes">recursive_program_schemes</a>] <a href="http://portal.acm.org/citation.cfm?id=114891.114900">URL</a>http://www.bibsonomy.org/bibtex/2ffe8cb9f8616dc0dc0bd04f12e98fd32/emanuelemanuel2008-10-02T16:31:30+02:00semantics recursive_program_schemes <span style="color:#555555;">Bruno <a href="http://www.bibsonomy.org/author/Courcelle">Courcelle</a> </span>(<em>1979</em>) <a href="http://www.bibsonomy.org/bibtex/2ffe8cb9f8616dc0dc0bd04f12e98fd32/emanuel"><i>Infinite Trees in Normal Form and Recursive Equations having a Unique Solution.</i></a><em>Theory of Computing Systems</em><em>Volume13. </em><em>Seite131--180. </em><em>Springer-Verlag, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/semantics">semantics</a> <a href="http://www.bibsonomy.org/user/emanuel/recursive_program_schemes">recursive_program_schemes</a>] <a href="http://dx.doi.org/10.1007/BF01744293">URL</a>overview of deductive, inductive, ilp, and from natural language automatic programming methodshttp://www.bibsonomy.org/bibtex/22dfc1ebc332f5dffbca9a86a10e2cdcd/emanuelemanuel2008-09-29T12:09:40+02:00program_synthesis ilp inductive_programming deductive_program_synthesis overview formal_methods ase analytical_ip induction ifp enumerative_ip lisp <span style="color:#555555;">Alan W. <a href="http://www.bibsonomy.org/author/Biermann">Biermann</a> </span>(<em>1992</em>) <a href="http://www.bibsonomy.org/bibtex/22dfc1ebc332f5dffbca9a86a10e2cdcd/emanuel"><i>Automatic Programming.</i></a><em>Encyclopedia of Artificial Intelligence, </em><em>New York, NY, USA, </em><em>John Wiley &amp; Sons, Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/deductive_program_synthesis">deductive_program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/overview">overview</a> <a href="http://www.bibsonomy.org/user/emanuel/formal_methods">formal_methods</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/lisp">lisp</a>]http://www.bibsonomy.org/bibtex/232926afbaaaf7962dc096458278dd340/emanuelemanuel2008-09-29T12:04:43+02:00machine_learning seminal_paper <span style="color:#555555;">Tom M. <a href="http://www.bibsonomy.org/author/Mitchell">Mitchell</a> </span>(<em>1982</em>) <a href="http://www.bibsonomy.org/bibtex/232926afbaaaf7962dc096458278dd340/emanuel"><i>Generalization as Search.</i></a><em>Artificial Intelligence</em><em>Volume18. </em><em>Seite203--226. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/seminal_paper">seminal_paper</a>]overview of deductive, inductive, from natural language automatic programming methodshttp://www.bibsonomy.org/bibtex/2dcb21e3082ae232c77c216130fab5233/emanuelemanuel2008-09-29T11:49:22+02:00program_synthesis inductive_programming deductive_program_synthesis ase analytical_ip induction ifp enumerative_ip lisp <span style="color:#555555;">A. W. <a href="http://www.bibsonomy.org/author/Biermann">Biermann</a> </span>(<em>1985</em>) <a href="http://www.bibsonomy.org/bibtex/2dcb21e3082ae232c77c216130fab5233/emanuel"><i>Automatic Programming: a Tutorial on Formal Methodologies.</i></a><em>Journal of Symbolic Compututation</em><em>Volume1. </em><em>Seite119--142. </em><em>Duluth, MN, USA, </em><em>Academic Press, Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/deductive_program_synthesis">deductive_program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/lisp">lisp</a>]overview over the synthesis of regular and scanning LISP programshttp://www.bibsonomy.org/bibtex/26a97b84c5863eb854eb5e50aa41a3b5b/emanuelemanuel2008-09-24T14:14:26+02:00program_synthesis inductive_programming analytical_ip induction ifp enumerative_ip lisp <span style="color:#555555;">Alan W. <a href="http://www.bibsonomy.org/author/Biermann">Biermann</a> </span>(<em>1984</em>) <a href="http://www.bibsonomy.org/bibtex/26a97b84c5863eb854eb5e50aa41a3b5b/emanuel"><i>Dealing With Search.</i></a><em>Automatic Program Construction Techniques, </em><em>Seite375--392. </em><em>Macmillan, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/lisp">lisp</a>]http://www.bibsonomy.org/bibtex/29583dd4d78041cc894e5edbccd2afa68/emanuelemanuel2008-09-18T11:25:43+02:00program_synthesis inductive_programming article analytical_ip induction constructor_systems igor2 rule-based_programming <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> und Ute <a href="http://www.bibsonomy.org/author/Schmid">Schmid</a> </span>(<em>2007</em>) <a href="http://www.bibsonomy.org/bibtex/29583dd4d78041cc894e5edbccd2afa68/emanuel"><i>Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities.</i></a><em>Electronic Notes in Theoretical Computer Science</em><em>Volume174. </em><em>Seite49--63. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/constructor_systems">constructor_systems</a> <a href="http://www.bibsonomy.org/user/emanuel/igor2">igor2</a> <a href="http://www.bibsonomy.org/user/emanuel/rule-based_programming">rule-based_programming</a>] <a href="http://dx.doi.org/10.1016/j.entcs.2006.11.015">URL</a>http://www.bibsonomy.org/bibtex/2ea46535b976123800c0e4731e09c8297/emanuelemanuel2008-09-18T10:57:25+02:00program_synthesis inductive_programming analytical_ip induction constructor_systems ifp igor2 inproceedings extended_abstract <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> </span>(<em>2008</em>) <a href="http://www.bibsonomy.org/bibtex/2ea46535b976123800c0e4731e09c8297/emanuel"><i>Data-driven Induction of Functional Programs.</i></a><em>ECAI 2008, 18th European Conference on Artificial Intelligence, Proceedings, </em><em>Seite781-782. </em><em>Amsterdam, Netherlands, </em><em>IOS Press, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/constructor_systems">constructor_systems</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/igor2">igor2</a> <a href="http://www.bibsonomy.org/user/emanuel/inproceedings">inproceedings</a> <a href="http://www.bibsonomy.org/user/emanuel/extended_abstract">extended_abstract</a>]first regularly published paper on IGOR2.2http://www.bibsonomy.org/bibtex/204cdcde370d3115dcfd216c4e55b7cdc/emanuelemanuel2008-09-18T10:43:04+02:00program_synthesis inductive_programming analytical_ip induction constructor_systems ifp igor2 inproceedings <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> </span>(<em>2008</em>) <a href="http://www.bibsonomy.org/bibtex/204cdcde370d3115dcfd216c4e55b7cdc/emanuel"><i>Analytical Inductive Functional Programming.</i></a><em>18th International Symposium on Logic-Based Program Synthesis and Transformation, </em><em>Springer-Verlag, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/constructor_systems">constructor_systems</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/igor2">igor2</a> <a href="http://www.bibsonomy.org/user/emanuel/inproceedings">inproceedings</a>]http://www.bibsonomy.org/bibtex/2ea922f34e86a1e8b7f529d7197787c0d/emanuelemanuel2008-09-17T16:47:53+02:00program_synthesis inductive_programming analytical_ip induction ifp <span style="color:#555555;">Jean-Pierre <a href="http://www.bibsonomy.org/author/Jouannaud">Jouannaud</a> und Yves <a href="http://www.bibsonomy.org/author/Kodratoff">Kodratoff</a> </span>(<em>1983</em>) <a href="http://www.bibsonomy.org/bibtex/2ea922f34e86a1e8b7f529d7197787c0d/emanuel"><i>Program Synthesis from Examples of Behavior.</i></a><em>Computer Program Synthesis Methodologies, </em><em>Seite213--250. </em><em>D. Reidel Publ. Co., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a>]http://www.bibsonomy.org/bibtex/2bc5b2d1bcd153ca109c2d9e28a3645b3/emanuelemanuel2008-09-17T16:29:19+02:00program_synthesis inductive_programming analytical_ip induction ifp lisp <span style="color:#555555;">Y. <a href="http://www.bibsonomy.org/author/Kodratoff">Kodratoff</a> und J. <a href="http://www.bibsonomy.org/author/Fargues">Fargues</a> </span>(<em>1978</em>) <a href="http://www.bibsonomy.org/bibtex/2bc5b2d1bcd153ca109c2d9e28a3645b3/emanuel"><i>A sane algorithm for the synthesis of LISP functions from example problems: The Boyer and Moore Algorithm.</i></a><em>Proceedings of the AISB/GI Conference on Artificial Intelligence, </em><em>Seite169--175. </em><em>Hamburg, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/lisp">lisp</a>]http://www.bibsonomy.org/bibtex/28f4e03c928c9c8eb35352d3fa23ee7f1/emanuelemanuel2008-09-17T16:14:19+02:00program_transformation <span style="color:#555555;">B. <a href="http://www.bibsonomy.org/author/Wegbreit">Wegbreit</a> </span>(<em>1976</em>) <a href="http://www.bibsonomy.org/bibtex/28f4e03c928c9c8eb35352d3fa23ee7f1/emanuel"><i>Goal-Directed Program Transformation.</i></a><em>IEEE Transactions on Software Engineering</em><em>Volume2. </em><em>Seite69--80. </em><em>Los Alamitos, CA, USA, </em><em>IEEE Computer Society, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a>]http://www.bibsonomy.org/bibtex/2beaaf44f9826ec1182106b6b1cd197b6/emanuelemanuel2008-09-17T16:00:32+02:00theorem_proving lisp <span style="color:#555555;">Robert S. <a href="http://www.bibsonomy.org/author/Boyer">Boyer</a> und J. <a href="http://www.bibsonomy.org/author/Strother Moore">Strother Moore</a> </span>(<em>1975</em>) <a href="http://www.bibsonomy.org/bibtex/2beaaf44f9826ec1182106b6b1cd197b6/emanuel"><i>Proving Theorems about LISP Functions.</i></a><em>Journal of the ACM</em><em>Volume22. </em><em>Seite129--144. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/theorem_proving">theorem_proving</a> <a href="http://www.bibsonomy.org/user/emanuel/lisp">lisp</a>]http://www.bibsonomy.org/bibtex/246ac00afe66805d7322b14fa4bbe91ae/emanuelemanuel2008-09-05T11:17:22+02:00program_synthesis inductive_programming term_rewriting analytical_ip induction ifp <span style="color:#555555;">Guillaume Le <a href="http://www.bibsonomy.org/author/Blanc">Blanc</a> </span>(<em>1994</em>) <a href="http://www.bibsonomy.org/bibtex/246ac00afe66805d7322b14fa4bbe91ae/emanuel"><i>BMWk Revisited: Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences.</i></a><em>ECML'94: Proceedings of the European Conference on Machine Learning, </em><em>Seite183--197. </em><em>Springer-Verlag, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/term_rewriting">term_rewriting</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a>] <a href="http://dx.doi.org/10.1007/3-540-57868-4_58">URL</a>