Hiding and behaviour: an institutional approach
Abstract: "Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1992
|
| Series: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
253 |
| Subjects: | |
| Summary: | Abstract: "Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas of some generality. We formulate the notion of behavioural equivalence in a more abstract and categorical way, and we give a general explication of 'hiding' in an institution. We use this [sic] show that both hidden many sorted algebras and hidden order sorted algebras yield institutions." |
| Physical Description: | 20 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009691190 | ||
| 003 | DE-604 | ||
| 005 | 20020228 | ||
| 007 | t | ||
| 008 | 940707s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28491265 | ||
| 035 | |a (DE-599)BVBBV009691190 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Burstall, Rod M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Hiding and behaviour |b an institutional approach |c Rod Burstall ; Razvan Diaconescu |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 253 | |
| 520 | 3 | |a Abstract: "Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas of some generality. We formulate the notion of behavioural equivalence in a more abstract and categorical way, and we give a general explication of 'hiding' in an institution. We use this [sic] show that both hidden many sorted algebras and hidden order sorted algebras yield institutions." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 700 | 1 | |a Diaconescu, Răzvan |e Verfasser |4 aut | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 253 |w (DE-604)BV008930032 |9 253 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006409081 | ||
Record in the Search Index
| _version_ | 1804124036220846080 |
|---|---|
| any_adam_object | |
| author | Burstall, Rod M. Diaconescu, Răzvan |
| author_facet | Burstall, Rod M. Diaconescu, Răzvan |
| author_role | aut aut |
| author_sort | Burstall, Rod M. |
| author_variant | r m b rm rmb r d rd |
| building | Verbundindex |
| bvnumber | BV009691190 |
| ctrlnum | (OCoLC)28491265 (DE-599)BVBBV009691190 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01670nam a2200313 cb4500</leader><controlfield tag="001">BV009691190</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940707s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28491265</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009691190</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">Burstall, Rod M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Hiding and behaviour</subfield><subfield code="b">an institutional approach</subfield><subfield code="c">Rod Burstall ; Razvan Diaconescu</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">20 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">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">253</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas of some generality. We formulate the notion of behavioural equivalence in a more abstract and categorical way, and we give a general explication of 'hiding' in an institution. We use this [sic] show that both hidden many sorted algebras and hidden order sorted algebras yield institutions."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</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">Sorting (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Diaconescu, Răzvan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">253</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">253</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006409081</subfield></datafield></record></collection> |
| id | DE-604.BV009691190 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:39:16Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006409081 |
| oclc_num | 28491265 |
| open_access_boolean | |
| physical | 20 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| series2 | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| spelling | Burstall, Rod M. Verfasser aut Hiding and behaviour an institutional approach Rod Burstall ; Razvan Diaconescu Edinburgh 1992 20 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 253 Abstract: "Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas of some generality. We formulate the notion of behavioural equivalence in a more abstract and categorical way, and we give a general explication of 'hiding' in an institution. We use this [sic] show that both hidden many sorted algebras and hidden order sorted algebras yield institutions." Applied statistics, operational research sigle Computer software sigle Sorting (Electronic computers) Diaconescu, Răzvan Verfasser aut Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 253 (DE-604)BV008930032 253 |
| spellingShingle | Burstall, Rod M. Diaconescu, Răzvan Hiding and behaviour an institutional approach Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Applied statistics, operational research sigle Computer software sigle Sorting (Electronic computers) |
| title | Hiding and behaviour an institutional approach |
| title_auth | Hiding and behaviour an institutional approach |
| title_exact_search | Hiding and behaviour an institutional approach |
| title_full | Hiding and behaviour an institutional approach Rod Burstall ; Razvan Diaconescu |
| title_fullStr | Hiding and behaviour an institutional approach Rod Burstall ; Razvan Diaconescu |
| title_full_unstemmed | Hiding and behaviour an institutional approach Rod Burstall ; Razvan Diaconescu |
| title_short | Hiding and behaviour |
| title_sort | hiding and behaviour an institutional approach |
| title_sub | an institutional approach |
| topic | Applied statistics, operational research sigle Computer software sigle Sorting (Electronic computers) |
| topic_facet | Applied statistics, operational research Computer software Sorting (Electronic computers) |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT burstallrodm hidingandbehaviouraninstitutionalapproach AT diaconescurazvan hidingandbehaviouraninstitutionalapproach |