Language constructs for programming by example

Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples . This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIGOIS bulletin 1986-12, Vol.7 (2-3), p.92-103
1. Verfasser: Rubin, Robert V.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 103
container_issue 2-3
container_start_page 92
container_title SIGOIS bulletin
container_volume 7
creator Rubin, Robert V.
description Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples . This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions for evaluation and control. Criteria are introduced for evaluating both the computational power and the expressiveness of the abstractions. The analysis demonstrates the existence of several previously unconsidered approaches to the more difficult problems associated with programming by example.
doi_str_mv 10.1145/15847.15858
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_15847_15858</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_15847_15858</sourcerecordid><originalsourceid>FETCH-crossref_primary_10_1145_15847_158583</originalsourceid><addsrcrecordid>eNpjYBA2NNAzNDQx1Tc0tTAx1wOSphYsDJwGFpYmugYWhpYcDFzFxVkGBoYWQMjJoOeTmJdempieqpCcn1dcUlSaXFKskJZfpFBQlJ9elJibm5mXrpBUqZBakZhbkJPKw8CalphTnMoLpbkZtN1cQ5w9dJOL8ouLi1LT4guKMnMTiyrjDQ3iQc6IBzsjHuwMY9JUAwDh0jnO</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Language constructs for programming by example</title><source>ACM Digital Library Complete</source><creator>Rubin, Robert V.</creator><creatorcontrib>Rubin, Robert V.</creatorcontrib><description>Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples . This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions for evaluation and control. Criteria are introduced for evaluating both the computational power and the expressiveness of the abstractions. The analysis demonstrates the existence of several previously unconsidered approaches to the more difficult problems associated with programming by example.</description><identifier>ISSN: 0894-0819</identifier><identifier>DOI: 10.1145/15847.15858</identifier><language>eng</language><ispartof>SIGOIS bulletin, 1986-12, Vol.7 (2-3), p.92-103</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-crossref_primary_10_1145_15847_158583</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Rubin, Robert V.</creatorcontrib><title>Language constructs for programming by example</title><title>SIGOIS bulletin</title><description>Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples . This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions for evaluation and control. Criteria are introduced for evaluating both the computational power and the expressiveness of the abstractions. The analysis demonstrates the existence of several previously unconsidered approaches to the more difficult problems associated with programming by example.</description><issn>0894-0819</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1986</creationdate><recordtype>article</recordtype><recordid>eNpjYBA2NNAzNDQx1Tc0tTAx1wOSphYsDJwGFpYmugYWhpYcDFzFxVkGBoYWQMjJoOeTmJdempieqpCcn1dcUlSaXFKskJZfpFBQlJ9elJibm5mXrpBUqZBakZhbkJPKw8CalphTnMoLpbkZtN1cQ5w9dJOL8ouLi1LT4guKMnMTiyrjDQ3iQc6IBzsjHuwMY9JUAwDh0jnO</recordid><startdate>198612</startdate><enddate>198612</enddate><creator>Rubin, Robert V.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>198612</creationdate><title>Language constructs for programming by example</title><author>Rubin, Robert V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-crossref_primary_10_1145_15847_158583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1986</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Rubin, Robert V.</creatorcontrib><collection>CrossRef</collection><jtitle>SIGOIS bulletin</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rubin, Robert V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Language constructs for programming by example</atitle><jtitle>SIGOIS bulletin</jtitle><date>1986-12</date><risdate>1986</risdate><volume>7</volume><issue>2-3</issue><spage>92</spage><epage>103</epage><pages>92-103</pages><issn>0894-0819</issn><abstract>Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples . This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions for evaluation and control. Criteria are introduced for evaluating both the computational power and the expressiveness of the abstractions. The analysis demonstrates the existence of several previously unconsidered approaches to the more difficult problems associated with programming by example.</abstract><doi>10.1145/15847.15858</doi></addata></record>
fulltext fulltext
identifier ISSN: 0894-0819
ispartof SIGOIS bulletin, 1986-12, Vol.7 (2-3), p.92-103
issn 0894-0819
language eng
recordid cdi_crossref_primary_10_1145_15847_15858
source ACM Digital Library Complete
title Language constructs for programming by example
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T08%3A56%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Language%20constructs%20for%20programming%20by%20example&rft.jtitle=SIGOIS%20bulletin&rft.au=Rubin,%20Robert%20V.&rft.date=1986-12&rft.volume=7&rft.issue=2-3&rft.spage=92&rft.epage=103&rft.pages=92-103&rft.issn=0894-0819&rft_id=info:doi/10.1145/15847.15858&rft_dat=%3Ccrossref%3E10_1145_15847_15858%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true