Towards a theory for abstract data types:
A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. The...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Laboratory for Computer Science
1980
|
| Subjects: | |
| Summary: | A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. The central notion in this framework is the definition of a data type. An algebraic and behavioral approach for defining a data type is developed which focuses on the input-output behavior of a data type as observed through its operations. The definition of a data type abstracts from the representational structure of its values as well as from the multiple representations of the values for any representational structure. A hierarchical specification language for data types is proposed. A deductive system based on first order multi-sorted predicate calculus with identity is developed for abstract data types. A correctness criterion is proposed for an implementation coded in a programming language with respect to a specification. It is defined as a relation between the semantics of an implementation and the semantics of a specification. It does not require a correct implementation to have the maximum amount of nondeterminism specified by a specification. A methodology for proving correctness of an implementation is developed which embodies the correctness criterion. |
| Physical Description: | 249 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876290 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880303s1980 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227451290 | ||
| 035 | |a (DE-599)BVBBV021876290 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-237 | ||
| 100 | 1 | |a Kapur, Deepak |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Towards a theory for abstract data types |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Laboratory for Computer Science |c 1980 | |
| 300 | |a 249 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. The central notion in this framework is the definition of a data type. An algebraic and behavioral approach for defining a data type is developed which focuses on the input-output behavior of a data type as observed through its operations. The definition of a data type abstracts from the representational structure of its values as well as from the multiple representations of the values for any representational structure. A hierarchical specification language for data types is proposed. A deductive system based on first order multi-sorted predicate calculus with identity is developed for abstract data types. A correctness criterion is proposed for an implementation coded in a programming language with respect to a specification. It is defined as a relation between the semantics of an implementation and the semantics of a specification. It does not require a correct implementation to have the maximum amount of nondeterminism specified by a specification. A methodology for proving correctness of an implementation is developed which embodies the correctness criterion. | |
| 650 | 7 | |a Boolean algebra |2 dtict | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Data bases |2 dtict | |
| 650 | 7 | |a Hierarchies |2 dtict | |
| 650 | 7 | |a Linguistics |2 scgdst | |
| 650 | 7 | |a Programming languages |2 dtict | |
| 650 | 7 | |a Semantics |2 dtict | |
| 650 | 7 | |a Specifications |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 650 | 7 | |a Validation |2 dtict | |
| 650 | 4 | |a Linguistik | |
| 650 | 0 | 7 | |a Datentyp |0 (DE-588)4011149-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Abstraktion |0 (DE-588)4141162-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datentyp |0 (DE-588)4011149-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Abstraktion |0 (DE-588)4141162-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091912 | ||
Record in the Search Index
| _version_ | 1804135815735934976 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kapur, Deepak |
| author_facet | Kapur, Deepak |
| author_role | aut |
| author_sort | Kapur, Deepak |
| author_variant | d k dk |
| building | Verbundindex |
| bvnumber | BV021876290 |
| ctrlnum | (OCoLC)227451290 (DE-599)BVBBV021876290 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02782nam a2200469zc 4500</leader><controlfield tag="001">BV021876290</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880303s1980 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227451290</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876290</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-237</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kapur, Deepak</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Towards a theory for abstract data types</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">249 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="520" ind1="3" ind2=" "><subfield code="a">A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. The central notion in this framework is the definition of a data type. An algebraic and behavioral approach for defining a data type is developed which focuses on the input-output behavior of a data type as observed through its operations. The definition of a data type abstracts from the representational structure of its values as well as from the multiple representations of the values for any representational structure. A hierarchical specification language for data types is proposed. A deductive system based on first order multi-sorted predicate calculus with identity is developed for abstract data types. A correctness criterion is proposed for an implementation coded in a programming language with respect to a specification. It is defined as a relation between the semantics of an implementation and the semantics of a specification. It does not require a correct implementation to have the maximum amount of nondeterminism specified by a specification. A methodology for proving correctness of an implementation is developed which embodies the correctness criterion.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Boolean algebra</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data bases</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Hierarchies</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programming languages</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semantics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Specifications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Validation</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linguistik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datentyp</subfield><subfield code="0">(DE-588)4011149-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstraktion</subfield><subfield code="0">(DE-588)4141162-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datentyp</subfield><subfield code="0">(DE-588)4011149-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Abstraktion</subfield><subfield code="0">(DE-588)4141162-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091912</subfield></datafield></record></collection> |
| id | DE-604.BV021876290 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091912 |
| oclc_num | 227451290 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 249 S. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Massachusetts Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Kapur, Deepak Verfasser aut Towards a theory for abstract data types Cambridge, Mass. Massachusetts Inst. of Technology, Laboratory for Computer Science 1980 249 S. txt rdacontent n rdamedia nc rdacarrier A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. The central notion in this framework is the definition of a data type. An algebraic and behavioral approach for defining a data type is developed which focuses on the input-output behavior of a data type as observed through its operations. The definition of a data type abstracts from the representational structure of its values as well as from the multiple representations of the values for any representational structure. A hierarchical specification language for data types is proposed. A deductive system based on first order multi-sorted predicate calculus with identity is developed for abstract data types. A correctness criterion is proposed for an implementation coded in a programming language with respect to a specification. It is defined as a relation between the semantics of an implementation and the semantics of a specification. It does not require a correct implementation to have the maximum amount of nondeterminism specified by a specification. A methodology for proving correctness of an implementation is developed which embodies the correctness criterion. Boolean algebra dtict Computer Programming and Software scgdst Data bases dtict Hierarchies dtict Linguistics scgdst Programming languages dtict Semantics dtict Specifications dtict Theses dtict Validation dtict Linguistik Datentyp (DE-588)4011149-0 gnd rswk-swf Abstraktion (DE-588)4141162-6 gnd rswk-swf Datentyp (DE-588)4011149-0 s DE-604 Abstraktion (DE-588)4141162-6 s |
| spellingShingle | Kapur, Deepak Towards a theory for abstract data types Boolean algebra dtict Computer Programming and Software scgdst Data bases dtict Hierarchies dtict Linguistics scgdst Programming languages dtict Semantics dtict Specifications dtict Theses dtict Validation dtict Linguistik Datentyp (DE-588)4011149-0 gnd Abstraktion (DE-588)4141162-6 gnd |
| subject_GND | (DE-588)4011149-0 (DE-588)4141162-6 |
| title | Towards a theory for abstract data types |
| title_auth | Towards a theory for abstract data types |
| title_exact_search | Towards a theory for abstract data types |
| title_exact_search_txtP | Towards a theory for abstract data types |
| title_full | Towards a theory for abstract data types |
| title_fullStr | Towards a theory for abstract data types |
| title_full_unstemmed | Towards a theory for abstract data types |
| title_short | Towards a theory for abstract data types |
| title_sort | towards a theory for abstract data types |
| topic | Boolean algebra dtict Computer Programming and Software scgdst Data bases dtict Hierarchies dtict Linguistics scgdst Programming languages dtict Semantics dtict Specifications dtict Theses dtict Validation dtict Linguistik Datentyp (DE-588)4011149-0 gnd Abstraktion (DE-588)4141162-6 gnd |
| topic_facet | Boolean algebra Computer Programming and Software Data bases Hierarchies Linguistics Programming languages Semantics Specifications Theses Validation Linguistik Datentyp Abstraktion |
| work_keys_str_mv | AT kapurdeepak towardsatheoryforabstractdatatypes |