A model for I O in equational languages with don't care non-determinism:
Abstract: "Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allow...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,72 |
| Subjects: | |
| Summary: | Abstract: "Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don't care non-determinism; the sequentialization of I/O is extensional rather than intensional. We apply this model to equational languages, which are closely related to functional languages, but exhibit don't care non-determinism. The semantics are formulated as constrained narrowing, a relation that contains the rewrite relation, and is contained in the narrowing relation. We present constrained narrowing and some of its properties; a constructive method to transform conventional term rewriting systems to constrained narrowing systems; and a discussion on requirements for an implementation." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011065113 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35190120 | ||
| 035 | |a (DE-599)BVBBV011065113 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Walters, Humphrey R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A model for I O in equational languages with don't care non-determinism |c H. R. Walters ; J. F. Th. Kamperman |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 13 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 95,72 | |
| 520 | 3 | |a Abstract: "Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don't care non-determinism; the sequentialization of I/O is extensional rather than intensional. We apply this model to equational languages, which are closely related to functional languages, but exhibit don't care non-determinism. The semantics are formulated as constrained narrowing, a relation that contains the rewrite relation, and is contained in the narrowing relation. We present constrained narrowing and some of its properties; a constructive method to transform conventional term rewriting systems to constrained narrowing systems; and a discussion on requirements for an implementation." | |
| 650 | 4 | |a Functional programming languages | |
| 650 | 4 | |a Logic programming languages | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 700 | 1 | |a Kamperman, Jasper F. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,72 |w (DE-604)BV008928356 |9 95,72 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410981 | ||
Record in the Search Index
| _version_ | 1804125554322964480 |
|---|---|
| any_adam_object | |
| author | Walters, Humphrey R. Kamperman, Jasper F. |
| author_facet | Walters, Humphrey R. Kamperman, Jasper F. |
| author_role | aut aut |
| author_sort | Walters, Humphrey R. |
| author_variant | h r w hr hrw j f k jf jfk |
| building | Verbundindex |
| bvnumber | BV011065113 |
| ctrlnum | (OCoLC)35190120 (DE-599)BVBBV011065113 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02068nam a2200313 cb4500</leader><controlfield tag="001">BV011065113</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35190120</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011065113</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="100" ind1="1" ind2=" "><subfield code="a">Walters, Humphrey R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A model for I O in equational languages with don't care non-determinism</subfield><subfield code="c">H. R. Walters ; J. F. Th. Kamperman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">95,72</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don't care non-determinism; the sequentialization of I/O is extensional rather than intensional. We apply this model to equational languages, which are closely related to functional languages, but exhibit don't care non-determinism. The semantics are formulated as constrained narrowing, a relation that contains the rewrite relation, and is contained in the narrowing relation. We present constrained narrowing and some of its properties; a constructive method to transform conventional term rewriting systems to constrained narrowing systems; and a discussion on requirements for an implementation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kamperman, Jasper F.</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">95,72</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,72</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410981</subfield></datafield></record></collection> |
| id | DE-604.BV011065113 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410981 |
| oclc_num | 35190120 |
| open_access_boolean | |
| physical | 13 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Walters, Humphrey R. Verfasser aut A model for I O in equational languages with don't care non-determinism H. R. Walters ; J. F. Th. Kamperman Amsterdam 1995 13 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,72 Abstract: "Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don't care non-determinism; the sequentialization of I/O is extensional rather than intensional. We apply this model to equational languages, which are closely related to functional languages, but exhibit don't care non-determinism. The semantics are formulated as constrained narrowing, a relation that contains the rewrite relation, and is contained in the narrowing relation. We present constrained narrowing and some of its properties; a constructive method to transform conventional term rewriting systems to constrained narrowing systems; and a discussion on requirements for an implementation." Functional programming languages Logic programming languages Programming languages (Electronic computers) Semantics Kamperman, Jasper F. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,72 (DE-604)BV008928356 95,72 |
| spellingShingle | Walters, Humphrey R. Kamperman, Jasper F. A model for I O in equational languages with don't care non-determinism Functional programming languages Logic programming languages Programming languages (Electronic computers) Semantics |
| title | A model for I O in equational languages with don't care non-determinism |
| title_auth | A model for I O in equational languages with don't care non-determinism |
| title_exact_search | A model for I O in equational languages with don't care non-determinism |
| title_full | A model for I O in equational languages with don't care non-determinism H. R. Walters ; J. F. Th. Kamperman |
| title_fullStr | A model for I O in equational languages with don't care non-determinism H. R. Walters ; J. F. Th. Kamperman |
| title_full_unstemmed | A model for I O in equational languages with don't care non-determinism H. R. Walters ; J. F. Th. Kamperman |
| title_short | A model for I O in equational languages with don't care non-determinism |
| title_sort | a model for i o in equational languages with don t care non determinism |
| topic | Functional programming languages Logic programming languages Programming languages (Electronic computers) Semantics |
| topic_facet | Functional programming languages Logic programming languages Programming languages (Electronic computers) Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT waltershumphreyr amodelforioinequationallanguageswithdontcarenondeterminism AT kampermanjasperf amodelforioinequationallanguageswithdontcarenondeterminism |