Constraint imperative programming a research proposal:
Abstract: "Some problems are best described in a declarative constraint language, while others are best described in an imperative language. In this research proposal, I propose to merge the two paradigms by adding constraints to the data store of an imperative language. The imperative language...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Seattle, Wash.
1989
|
Ausgabe: | Rev. |
Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
89,4,6 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Some problems are best described in a declarative constraint language, while others are best described in an imperative language. In this research proposal, I propose to merge the two paradigms by adding constraints to the data store of an imperative language. The imperative language is augmented with expressions that create and remove constraints from the store, and the semantics of variable reads and writes are modified as appropriate. This merging is named Constraint Imperative Programming, or CIP (pronounced 'kip'), and is actually a framework for languages. An instance of CIP is parameterized by an imperative language and a constraint system This proposal defines Kaleidoscope, an object-oriented CIP language based on Emerald and ThingLab II. A number of examples written in Kaleidoscope are provided to demonstrate its usefulness for a wide variety of programming problems. Additionally, object-oriented CIP naturally creates a viewing language in which there are multiple views or facets of each object. Views in Kaleidoscope are discussed, and this proposal closes with implementation considerations and further research possibilities. |
Beschreibung: | 34 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009258314 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1989 |||| 00||| eng d | ||
035 | |a (OCoLC)23932789 | ||
035 | |a (DE-599)BVBBV009258314 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Freeman-Benson, Bjorn N. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Constraint imperative programming a research proposal |
250 | |a Rev. | ||
264 | 1 | |a Seattle, Wash. |c 1989 | |
300 | |a 34 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 89,4,6 | |
520 | 3 | |a Abstract: "Some problems are best described in a declarative constraint language, while others are best described in an imperative language. In this research proposal, I propose to merge the two paradigms by adding constraints to the data store of an imperative language. The imperative language is augmented with expressions that create and remove constraints from the store, and the semantics of variable reads and writes are modified as appropriate. This merging is named Constraint Imperative Programming, or CIP (pronounced 'kip'), and is actually a framework for languages. An instance of CIP is parameterized by an imperative language and a constraint system | |
520 | 3 | |a This proposal defines Kaleidoscope, an object-oriented CIP language based on Emerald and ThingLab II. A number of examples written in Kaleidoscope are provided to demonstrate its usefulness for a wide variety of programming problems. Additionally, object-oriented CIP naturally creates a viewing language in which there are multiple views or facets of each object. Views in Kaleidoscope are discussed, and this proposal closes with implementation considerations and further research possibilities. | |
650 | 4 | |a Logic programming | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 89,4,6 |w (DE-604)BV008930431 |9 89,4,6 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006160370 |
Datensatz im Suchindex
_version_ | 1804123705572327424 |
---|---|
any_adam_object | |
author | Freeman-Benson, Bjorn N. |
author_facet | Freeman-Benson, Bjorn N. |
author_role | aut |
author_sort | Freeman-Benson, Bjorn N. |
author_variant | b n f b bnf bnfb |
building | Verbundindex |
bvnumber | BV009258314 |
ctrlnum | (OCoLC)23932789 (DE-599)BVBBV009258314 |
edition | Rev. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02158nam a2200313 cb4500</leader><controlfield tag="001">BV009258314</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23932789</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009258314</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">Freeman-Benson, Bjorn N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint imperative programming a research proposal</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Rev.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">89,4,6</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Some problems are best described in a declarative constraint language, while others are best described in an imperative language. In this research proposal, I propose to merge the two paradigms by adding constraints to the data store of an imperative language. The imperative language is augmented with expressions that create and remove constraints from the store, and the semantics of variable reads and writes are modified as appropriate. This merging is named Constraint Imperative Programming, or CIP (pronounced 'kip'), and is actually a framework for languages. An instance of CIP is parameterized by an imperative language and a constraint system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This proposal defines Kaleidoscope, an object-oriented CIP language based on Emerald and ThingLab II. A number of examples written in Kaleidoscope are provided to demonstrate its usefulness for a wide variety of programming problems. Additionally, object-oriented CIP naturally creates a viewing language in which there are multiple views or facets of each object. Views in Kaleidoscope are discussed, and this proposal closes with implementation considerations and further research possibilities.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">89,4,6</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">89,4,6</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160370</subfield></datafield></record></collection> |
id | DE-604.BV009258314 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:34:01Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160370 |
oclc_num | 23932789 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 34 S. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
spelling | Freeman-Benson, Bjorn N. Verfasser aut Constraint imperative programming a research proposal Rev. Seattle, Wash. 1989 34 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 89,4,6 Abstract: "Some problems are best described in a declarative constraint language, while others are best described in an imperative language. In this research proposal, I propose to merge the two paradigms by adding constraints to the data store of an imperative language. The imperative language is augmented with expressions that create and remove constraints from the store, and the semantics of variable reads and writes are modified as appropriate. This merging is named Constraint Imperative Programming, or CIP (pronounced 'kip'), and is actually a framework for languages. An instance of CIP is parameterized by an imperative language and a constraint system This proposal defines Kaleidoscope, an object-oriented CIP language based on Emerald and ThingLab II. A number of examples written in Kaleidoscope are provided to demonstrate its usefulness for a wide variety of programming problems. Additionally, object-oriented CIP naturally creates a viewing language in which there are multiple views or facets of each object. Views in Kaleidoscope are discussed, and this proposal closes with implementation considerations and further research possibilities. Logic programming Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 89,4,6 (DE-604)BV008930431 89,4,6 |
spellingShingle | Freeman-Benson, Bjorn N. Constraint imperative programming a research proposal Logic programming |
title | Constraint imperative programming a research proposal |
title_auth | Constraint imperative programming a research proposal |
title_exact_search | Constraint imperative programming a research proposal |
title_full | Constraint imperative programming a research proposal |
title_fullStr | Constraint imperative programming a research proposal |
title_full_unstemmed | Constraint imperative programming a research proposal |
title_short | Constraint imperative programming a research proposal |
title_sort | constraint imperative programming a research proposal |
topic | Logic programming |
topic_facet | Logic programming |
volume_link | (DE-604)BV008930431 |
work_keys_str_mv | AT freemanbensonbjornn constraintimperativeprogrammingaresearchproposal |