A calculus of refinements: its class of models
Abstract: "Data and its classification into types are kept separated and used distinctively in most programming languages. Types are mainly used as a discipline that contributes to program correctness and computation is not done on types. Nevertheless types have also been considered as specific...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
594 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Data and its classification into types are kept separated and used distinctively in most programming languages. Types are mainly used as a discipline that contributes to program correctness and computation is not done on types. Nevertheless types have also been considered as specifications. The subtyping can be seen as a kind of specification refinement defining a type hierarchy where programs are the leaves on which computation is done. The Calculus of Refinements (COR) presented here takes this idea of types as specifications and subtyping as refinement and pushes it to an extreme. Types and values are no longer distinguished; in COR we consider a unique hierarchy of objects without distinctions between leaves and the rest of nodes. The subtyping relation is the only relation between objects and it is called refinement: an object is a refinement of another if the latter is a more specified version of the former. A good way to deal with hierarchy of objects is to structure it as a complete lattice. And if functions are to be considered as first class citizens in the hierarchy then the lattice must be reflexive: it must have the space of functions (some of them) as a sublattice. So complete reflexive lattices are the intended semantic domains we want to use to model stepwise refinement from specifications (upper objects in the hierarchy) to programs (objects well defined for the actual purposes of the programmer). We have shown how these lattices can be used as a semantic basis for knowledge representation languages." |
| Beschreibung: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010459786 | ||
| 003 | DE-604 | ||
| 005 | 20041228 | ||
| 007 | t | ||
| 008 | 951031s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)31987329 | ||
| 035 | |a (DE-599)BVBBV010459786 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a A calculus of refinements |b its class of models |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 594 | |
| 520 | 3 | |a Abstract: "Data and its classification into types are kept separated and used distinctively in most programming languages. Types are mainly used as a discipline that contributes to program correctness and computation is not done on types. Nevertheless types have also been considered as specifications. The subtyping can be seen as a kind of specification refinement defining a type hierarchy where programs are the leaves on which computation is done. The Calculus of Refinements (COR) presented here takes this idea of types as specifications and subtyping as refinement and pushes it to an extreme. Types and values are no longer distinguished; in COR we consider a unique hierarchy of objects without distinctions between leaves and the rest of nodes. The subtyping relation is the only relation between objects and it is called refinement: an object is a refinement of another if the latter is a more specified version of the former. A good way to deal with hierarchy of objects is to structure it as a complete lattice. And if functions are to be considered as first class citizens in the hierarchy then the lattice must be reflexive: it must have the space of functions (some of them) as a sublattice. So complete reflexive lattices are the intended semantic domains we want to use to model stepwise refinement from specifications (upper objects in the hierarchy) to programs (objects well defined for the actual purposes of the programmer). We have shown how these lattices can be used as a semantic basis for knowledge representation languages." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Computer programming | |
| 700 | 1 | |a Agustí i Cullell, Jaume |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 594 |w (DE-604)BV010450646 |9 594 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006968756 | ||
Datensatz im Suchindex
| _version_ | 1804124890903609344 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV010459786 |
| ctrlnum | (OCoLC)31987329 (DE-599)BVBBV010459786 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02576nam a2200313 cb4500</leader><controlfield tag="001">BV010459786</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951031s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31987329</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010459786</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-91G</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A calculus of refinements</subfield><subfield code="b">its class of models</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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 <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">594</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Data and its classification into types are kept separated and used distinctively in most programming languages. Types are mainly used as a discipline that contributes to program correctness and computation is not done on types. Nevertheless types have also been considered as specifications. The subtyping can be seen as a kind of specification refinement defining a type hierarchy where programs are the leaves on which computation is done. The Calculus of Refinements (COR) presented here takes this idea of types as specifications and subtyping as refinement and pushes it to an extreme. Types and values are no longer distinguished; in COR we consider a unique hierarchy of objects without distinctions between leaves and the rest of nodes. The subtyping relation is the only relation between objects and it is called refinement: an object is a refinement of another if the latter is a more specified version of the former. A good way to deal with hierarchy of objects is to structure it as a complete lattice. And if functions are to be considered as first class citizens in the hierarchy then the lattice must be reflexive: it must have the space of functions (some of them) as a sublattice. So complete reflexive lattices are the intended semantic domains we want to use to model stepwise refinement from specifications (upper objects in the hierarchy) to programs (objects well defined for the actual purposes of the programmer). We have shown how these lattices can be used as a semantic basis for knowledge representation languages."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Agustí i Cullell, Jaume</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">594</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">594</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006968756</subfield></datafield></record></collection> |
| id | DE-604.BV010459786 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006968756 |
| oclc_num | 31987329 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | A calculus of refinements its class of models Edinburgh 1992 9 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 594 Abstract: "Data and its classification into types are kept separated and used distinctively in most programming languages. Types are mainly used as a discipline that contributes to program correctness and computation is not done on types. Nevertheless types have also been considered as specifications. The subtyping can be seen as a kind of specification refinement defining a type hierarchy where programs are the leaves on which computation is done. The Calculus of Refinements (COR) presented here takes this idea of types as specifications and subtyping as refinement and pushes it to an extreme. Types and values are no longer distinguished; in COR we consider a unique hierarchy of objects without distinctions between leaves and the rest of nodes. The subtyping relation is the only relation between objects and it is called refinement: an object is a refinement of another if the latter is a more specified version of the former. A good way to deal with hierarchy of objects is to structure it as a complete lattice. And if functions are to be considered as first class citizens in the hierarchy then the lattice must be reflexive: it must have the space of functions (some of them) as a sublattice. So complete reflexive lattices are the intended semantic domains we want to use to model stepwise refinement from specifications (upper objects in the hierarchy) to programs (objects well defined for the actual purposes of the programmer). We have shown how these lattices can be used as a semantic basis for knowledge representation languages." Bionics and artificial intelligence sigle Computer software sigle Computer programming Agustí i Cullell, Jaume Sonstige oth Department of Artificial Intelligence: DAI research paper University <Edinburgh> 594 (DE-604)BV010450646 594 |
| spellingShingle | A calculus of refinements its class of models Bionics and artificial intelligence sigle Computer software sigle Computer programming |
| title | A calculus of refinements its class of models |
| title_auth | A calculus of refinements its class of models |
| title_exact_search | A calculus of refinements its class of models |
| title_full | A calculus of refinements its class of models |
| title_fullStr | A calculus of refinements its class of models |
| title_full_unstemmed | A calculus of refinements its class of models |
| title_short | A calculus of refinements |
| title_sort | a calculus of refinements its class of models |
| title_sub | its class of models |
| topic | Bionics and artificial intelligence sigle Computer software sigle Computer programming |
| topic_facet | Bionics and artificial intelligence Computer software Computer programming |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT agustiicullelljaume acalculusofrefinementsitsclassofmodels |