Order sorted algebra solves the constructor-selector, multiple representation and coercion problems:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1990
|
| Schriftenreihe: | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL
90,6 |
| Schlagwörter: | |
| Abstract: | Abstract: "Structured data are generally composed from constituent parts by constructors and decomposed by selectors. We show that the usual many-sorted algebra approach to abstract data types cannot capture this simple intuition in a satisfactory way. We also show that order-sorted algebra does solve this problem, and many others concerning partially defined, ill-defined and erroneous expressions, in a simple and natural way. In particular, we show how order-sorted algebra supports an elegant solution to the problems of multiple representations and coercions. The essence of order-sorted algebra is that sorts have subsorts, whose semantic interpretation is the subset relation on the carriers of algebras." |
| Umfang: | 35 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949444 | ||
| 003 | DE-604 | ||
| 005 | 20171123 | ||
| 007 | t| | ||
| 008 | 940206s1990 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)23261424 | ||
| 035 | |a (DE-599)BVBBV008949444 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Meseguer, José |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Order sorted algebra solves the constructor-selector, multiple representation and coercion problems |c José Meseguer ; Joseph A. Goguen |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 35 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 90,6 | |
| 520 | 3 | |a Abstract: "Structured data are generally composed from constituent parts by constructors and decomposed by selectors. We show that the usual many-sorted algebra approach to abstract data types cannot capture this simple intuition in a satisfactory way. We also show that order-sorted algebra does solve this problem, and many others concerning partially defined, ill-defined and erroneous expressions, in a simple and natural way. In particular, we show how order-sorted algebra supports an elegant solution to the problems of multiple representations and coercions. The essence of order-sorted algebra is that sorts have subsorts, whose semantic interpretation is the subset relation on the carriers of algebras." | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Ordered algebraic structures | |
| 700 | 1 | |a Goguen, Joseph |d 1941-2006 |e Verfasser |0 (DE-588)172100275 |4 aut | |
| 830 | 0 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 90,6 |w (DE-604)BV008930658 |9 90,6 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005905104 | |
Datensatz im Suchindex
| _version_ | 1818951112747646976 |
|---|---|
| any_adam_object | |
| author | Meseguer, José Goguen, Joseph 1941-2006 |
| author_GND | (DE-588)172100275 |
| author_facet | Meseguer, José Goguen, Joseph 1941-2006 |
| author_role | aut aut |
| author_sort | Meseguer, José |
| author_variant | j m jm j g jg |
| building | Verbundindex |
| bvnumber | BV008949444 |
| ctrlnum | (OCoLC)23261424 (DE-599)BVBBV008949444 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01814nam a2200313 cb4500</leader><controlfield tag="001">BV008949444</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171123 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1990 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23261424</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949444</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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">Meseguer, José</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Order sorted algebra solves the constructor-selector, multiple representation and coercion problems</subfield><subfield code="c">José Meseguer ; Joseph A. Goguen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 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">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">90,6</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Structured data are generally composed from constituent parts by constructors and decomposed by selectors. We show that the usual many-sorted algebra approach to abstract data types cannot capture this simple intuition in a satisfactory way. We also show that order-sorted algebra does solve this problem, and many others concerning partially defined, ill-defined and erroneous expressions, in a simple and natural way. In particular, we show how order-sorted algebra supports an elegant solution to the problems of multiple representations and coercions. The essence of order-sorted algebra is that sorts have subsorts, whose semantic interpretation is the subset relation on the carriers of algebras."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordered algebraic structures</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goguen, Joseph</subfield><subfield code="d">1941-2006</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172100275</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">90,6</subfield><subfield code="w">(DE-604)BV008930658</subfield><subfield code="9">90,6</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905104</subfield></datafield></record></collection> |
| id | DE-604.BV008949444 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:29:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905104 |
| oclc_num | 23261424 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 35 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| series2 | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| spelling | Meseguer, José Verfasser aut Order sorted algebra solves the constructor-selector, multiple representation and coercion problems José Meseguer ; Joseph A. Goguen Stanford, Calif. 1990 35 S. txt rdacontent n rdamedia nc rdacarrier Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 90,6 Abstract: "Structured data are generally composed from constituent parts by constructors and decomposed by selectors. We show that the usual many-sorted algebra approach to abstract data types cannot capture this simple intuition in a satisfactory way. We also show that order-sorted algebra does solve this problem, and many others concerning partially defined, ill-defined and erroneous expressions, in a simple and natural way. In particular, we show how order-sorted algebra supports an elegant solution to the problems of multiple representations and coercions. The essence of order-sorted algebra is that sorts have subsorts, whose semantic interpretation is the subset relation on the carriers of algebras." Abstract data types (Computer science) Ordered algebraic structures Goguen, Joseph 1941-2006 Verfasser (DE-588)172100275 aut Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 90,6 (DE-604)BV008930658 90,6 |
| spellingShingle | Meseguer, José Goguen, Joseph 1941-2006 Order sorted algebra solves the constructor-selector, multiple representation and coercion problems Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL Abstract data types (Computer science) Ordered algebraic structures |
| title | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems |
| title_auth | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems |
| title_exact_search | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems |
| title_full | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems José Meseguer ; Joseph A. Goguen |
| title_fullStr | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems José Meseguer ; Joseph A. Goguen |
| title_full_unstemmed | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems José Meseguer ; Joseph A. Goguen |
| title_short | Order sorted algebra solves the constructor-selector, multiple representation and coercion problems |
| title_sort | order sorted algebra solves the constructor selector multiple representation and coercion problems |
| topic | Abstract data types (Computer science) Ordered algebraic structures |
| topic_facet | Abstract data types (Computer science) Ordered algebraic structures |
| volume_link | (DE-604)BV008930658 |
| work_keys_str_mv | AT meseguerjose ordersortedalgebrasolvestheconstructorselectormultiplerepresentationandcoercionproblems AT goguenjoseph ordersortedalgebrasolvestheconstructorselectormultiplerepresentationandcoercionproblems |