Implementing higher-order algebraic specifications:
Abstract: "Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow left-hand sides of equations to be complex first-order patterns that would not be allowed in...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,50 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow left-hand sides of equations to be complex first-order patterns that would not be allowed in functional languages. Functional languages, on the other hand, have powerful higher-order features not offered by algebraic specification languages. Some functional languages combine higher-order functions with linear first-order patterns involving free data type constructors, thus offering a limited (but highly expressive) mixture of functional programming and algebraic specification A more ambitious integration of the two is obtained by allowing both signatures and equations in algebraic specifications to be higher- order. Operational experiments with such higher-order algebraic specifications can be performed by translating them to [lambda]Prolog, an extension of Prolog to polymorphically typed [lambda]-terms based on higher-order unification. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993168 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27471560 | ||
| 035 | |a (DE-599)BVBBV008993168 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Heering, Jan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Implementing higher-order algebraic specifications |c J. Heering |
| 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,50 | |
| 520 | 3 | |a Abstract: "Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow left-hand sides of equations to be complex first-order patterns that would not be allowed in functional languages. Functional languages, on the other hand, have powerful higher-order features not offered by algebraic specification languages. Some functional languages combine higher-order functions with linear first-order patterns involving free data type constructors, thus offering a limited (but highly expressive) mixture of functional programming and algebraic specification | |
| 520 | 3 | |a A more ambitious integration of the two is obtained by allowing both signatures and equations in algebraic specifications to be higher- order. Operational experiments with such higher-order algebraic specifications can be performed by translating them to [lambda]Prolog, an extension of Prolog to polymorphically typed [lambda]-terms based on higher-order unification. | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,50 |w (DE-604)BV008928356 |9 91,50 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941991 | ||
Datensatz im Suchindex
| _version_ | 1804123335667220480 |
|---|---|
| any_adam_object | |
| author | Heering, Jan |
| author_facet | Heering, Jan |
| author_role | aut |
| author_sort | Heering, Jan |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV008993168 |
| ctrlnum | (OCoLC)27471560 (DE-599)BVBBV008993168 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02067nam a2200313 cb4500</leader><controlfield tag="001">BV008993168</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27471560</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993168</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, Jan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Implementing higher-order algebraic specifications</subfield><subfield code="c">J. Heering</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,50</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow left-hand sides of equations to be complex first-order patterns that would not be allowed in functional languages. Functional languages, on the other hand, have powerful higher-order features not offered by algebraic specification languages. Some functional languages combine higher-order functions with linear first-order patterns involving free data type constructors, thus offering a limited (but highly expressive) mixture of functional programming and algebraic specification</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A more ambitious integration of the two is obtained by allowing both signatures and equations in algebraic specifications to be higher- order. Operational experiments with such higher-order algebraic specifications can be performed by translating them to [lambda]Prolog, an extension of Prolog to polymorphically typed [lambda]-terms based on higher-order unification.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</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,50</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,50</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941991</subfield></datafield></record></collection> |
| id | DE-604.BV008993168 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941991 |
| oclc_num | 27471560 |
| 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, Jan Verfasser aut Implementing higher-order algebraic specifications J. Heering Amsterdam 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,50 Abstract: "Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow left-hand sides of equations to be complex first-order patterns that would not be allowed in functional languages. Functional languages, on the other hand, have powerful higher-order features not offered by algebraic specification languages. Some functional languages combine higher-order functions with linear first-order patterns involving free data type constructors, thus offering a limited (but highly expressive) mixture of functional programming and algebraic specification A more ambitious integration of the two is obtained by allowing both signatures and equations in algebraic specifications to be higher- order. Operational experiments with such higher-order algebraic specifications can be performed by translating them to [lambda]Prolog, an extension of Prolog to polymorphically typed [lambda]-terms based on higher-order unification. Logic programming Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,50 (DE-604)BV008928356 91,50 |
| spellingShingle | Heering, Jan Implementing higher-order algebraic specifications Logic programming Rewriting systems (Computer science) |
| title | Implementing higher-order algebraic specifications |
| title_auth | Implementing higher-order algebraic specifications |
| title_exact_search | Implementing higher-order algebraic specifications |
| title_full | Implementing higher-order algebraic specifications J. Heering |
| title_fullStr | Implementing higher-order algebraic specifications J. Heering |
| title_full_unstemmed | Implementing higher-order algebraic specifications J. Heering |
| title_short | Implementing higher-order algebraic specifications |
| title_sort | implementing higher order algebraic specifications |
| topic | Logic programming Rewriting systems (Computer science) |
| topic_facet | Logic programming Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT heeringjan implementinghigherorderalgebraicspecifications |