Lazy and incremental program generation:
Abstract: "Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to ge...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Ausgabe: | Revised version |
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,24 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to generate only those parts of the program that are indispensable for processing the particular data at hand. We call this lazy program generation. Another, closely related, strategy is incremental program generation. When its input is modified, an incremental generator will try to make a corresponding modification in its output rather than generate a completely new program It may be advantageous to use a combination of both strategies in program generators that have to operate in a highly dynamic and/or interactive environment. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009225183 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27320687 | ||
| 035 | |a (DE-599)BVBBV009225183 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Heering, J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lazy and incremental program generation |c J. Heering ; P. Klint ; J. Rekers |
| 250 | |a Revised version | ||
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 91,24 | |
| 520 | 3 | |a Abstract: "Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to generate only those parts of the program that are indispensable for processing the particular data at hand. We call this lazy program generation. Another, closely related, strategy is incremental program generation. When its input is modified, an incremental generator will try to make a corresponding modification in its output rather than generate a completely new program | |
| 520 | 3 | |a It may be advantageous to use a combination of both strategies in program generators that have to operate in a highly dynamic and/or interactive environment. | |
| 650 | 4 | |a Automatic programming (Computer science) | |
| 700 | 1 | |a Klint, P. |e Verfasser |4 aut | |
| 700 | 1 | |a Rekers, J. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,24 |w (DE-604)BV008928356 |9 91,24 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006134291 | ||
Datensatz im Suchindex
| _version_ | 1804123668322713600 |
|---|---|
| any_adam_object | |
| author | Heering, J. Klint, P. Rekers, J. |
| author_facet | Heering, J. Klint, P. Rekers, J. |
| author_role | aut aut aut |
| author_sort | Heering, J. |
| author_variant | j h jh p k pk j r jr |
| building | Verbundindex |
| bvnumber | BV009225183 |
| ctrlnum | (OCoLC)27320687 (DE-599)BVBBV009225183 |
| edition | Revised version |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01939nam a2200337 cb4500</leader><controlfield tag="001">BV009225183</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27320687</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009225183</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heering, J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lazy and incremental program generation</subfield><subfield code="c">J. Heering ; P. Klint ; J. Rekers</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Revised version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,24</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to generate only those parts of the program that are indispensable for processing the particular data at hand. We call this lazy program generation. Another, closely related, strategy is incremental program generation. When its input is modified, an incremental generator will try to make a corresponding modification in its output rather than generate a completely new program</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It may be advantageous to use a combination of both strategies in program generators that have to operate in a highly dynamic and/or interactive environment.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic programming (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Klint, P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rekers, J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">91,24</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,24</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006134291</subfield></datafield></record></collection> |
| id | DE-604.BV009225183 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006134291 |
| oclc_num | 27320687 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Heering, J. Verfasser aut Lazy and incremental program generation J. Heering ; P. Klint ; J. Rekers Revised version Amsterdam 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,24 Abstract: "Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to generate only those parts of the program that are indispensable for processing the particular data at hand. We call this lazy program generation. Another, closely related, strategy is incremental program generation. When its input is modified, an incremental generator will try to make a corresponding modification in its output rather than generate a completely new program It may be advantageous to use a combination of both strategies in program generators that have to operate in a highly dynamic and/or interactive environment. Automatic programming (Computer science) Klint, P. Verfasser aut Rekers, J. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,24 (DE-604)BV008928356 91,24 |
| spellingShingle | Heering, J. Klint, P. Rekers, J. Lazy and incremental program generation Automatic programming (Computer science) |
| title | Lazy and incremental program generation |
| title_auth | Lazy and incremental program generation |
| title_exact_search | Lazy and incremental program generation |
| title_full | Lazy and incremental program generation J. Heering ; P. Klint ; J. Rekers |
| title_fullStr | Lazy and incremental program generation J. Heering ; P. Klint ; J. Rekers |
| title_full_unstemmed | Lazy and incremental program generation J. Heering ; P. Klint ; J. Rekers |
| title_short | Lazy and incremental program generation |
| title_sort | lazy and incremental program generation |
| topic | Automatic programming (Computer science) |
| topic_facet | Automatic programming (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT heeringj lazyandincrementalprogramgeneration AT klintp lazyandincrementalprogramgeneration AT rekersj lazyandincrementalprogramgeneration |