Abstract data types in stack based languages:
Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1978
|
Schlagworte: | |
Zusammenfassung: | Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design of a new language incorporating abstract data types; the language requires only a run-time stack, and not garbage collection. This new language, called ASBAL(for 'A Stack Based Abstraction Language'), is based on CLU, and borrows as many features as possible directly from it. Virtually every significant feature of CLU is carried over into ASBAL in some form, and extensions are included when necessary. For example, the maximum size of objects becomes an issue and is resolved by the addition of size parameters to types. Also, a limited facility for dynamic storage allocation is incorporated in ASBAL to compensate for the removal of a garbage collected heap. This facility allows list and graph structures to be built within the framework of the stack while preventing dangling references as a 'side-effect' of compile-time type checking. (Author). |
Beschreibung: | Zugl.: Cambridge, Mass., Mass. Inst. of Techn., Diss., 1977 |
Beschreibung: | 154 S. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021879864 | ||
003 | DE-604 | ||
005 | 20040229000000.0 | ||
007 | t | ||
008 | 880811s1978 |||| 00||| eng d | ||
035 | |a (OCoLC)227489722 | ||
035 | |a (DE-599)BVBBV021879864 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a MIT/LCS/TR-190 | ||
100 | 1 | |a Moss, John E. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Abstract data types in stack based languages |c by John Eliot Blakeslee Moss |
264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1978 | |
300 | |a 154 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Zugl.: Cambridge, Mass., Mass. Inst. of Techn., Diss., 1977 | ||
520 | 3 | |a Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design of a new language incorporating abstract data types; the language requires only a run-time stack, and not garbage collection. This new language, called ASBAL(for 'A Stack Based Abstraction Language'), is based on CLU, and borrows as many features as possible directly from it. Virtually every significant feature of CLU is carried over into ASBAL in some form, and extensions are included when necessary. For example, the maximum size of objects becomes an issue and is resolved by the addition of size parameters to types. Also, a limited facility for dynamic storage allocation is incorporated in ASBAL to compensate for the removal of a garbage collected heap. This facility allows list and graph structures to be built within the framework of the stack while preventing dangling references as a 'side-effect' of compile-time type checking. (Author). | |
650 | 7 | |a Computer Programming and Software |2 scgdst | |
650 | 7 | |a Computer programming |2 dtict | |
650 | 7 | |a Computer programs |2 dtict | |
650 | 7 | |a Parameters |2 dtict | |
650 | 7 | |a Programming languages |2 dtict | |
650 | 7 | |a Theses |2 dtict | |
650 | 0 | 7 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |D s |
689 | 1 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015095322 |
Datensatz im Suchindex
_version_ | 1804135820079136768 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Moss, John E. |
author_facet | Moss, John E. |
author_role | aut |
author_sort | Moss, John E. |
author_variant | j e m je jem |
building | Verbundindex |
bvnumber | BV021879864 |
ctrlnum | (OCoLC)227489722 (DE-599)BVBBV021879864 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02541nam a2200421zc 4500</leader><controlfield tag="001">BV021879864</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880811s1978 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227489722</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879864</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-190</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moss, John E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Abstract data types in stack based languages</subfield><subfield code="c">by John Eliot Blakeslee Moss</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">154 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="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Mass., Mass. Inst. of Techn., Diss., 1977</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design of a new language incorporating abstract data types; the language requires only a run-time stack, and not garbage collection. This new language, called ASBAL(for 'A Stack Based Abstraction Language'), is based on CLU, and borrows as many features as possible directly from it. Virtually every significant feature of CLU is carried over into ASBAL in some form, and extensions are included when necessary. For example, the maximum size of objects becomes an issue and is resolved by the addition of size parameters to types. Also, a limited facility for dynamic storage allocation is incorporated in ASBAL to compensate for the removal of a garbage collected heap. This facility allows list and graph structures to be built within the framework of the stack while preventing dangling references as a 'side-effect' of compile-time type checking. (Author).</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">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parameters</subfield><subfield code="2">dtict</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">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</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">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</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-015095322</subfield></datafield></record></collection> |
id | DE-604.BV021879864 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:03:43Z |
indexdate | 2024-07-09T20:46:34Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015095322 |
oclc_num | 227489722 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 154 S. |
publishDate | 1978 |
publishDateSearch | 1978 |
publishDateSort | 1978 |
publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
record_format | marc |
spelling | Moss, John E. Verfasser aut Abstract data types in stack based languages by John Eliot Blakeslee Moss Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1978 154 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Cambridge, Mass., Mass. Inst. of Techn., Diss., 1977 Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design of a new language incorporating abstract data types; the language requires only a run-time stack, and not garbage collection. This new language, called ASBAL(for 'A Stack Based Abstraction Language'), is based on CLU, and borrows as many features as possible directly from it. Virtually every significant feature of CLU is carried over into ASBAL in some form, and extensions are included when necessary. For example, the maximum size of objects becomes an issue and is resolved by the addition of size parameters to types. Also, a limited facility for dynamic storage allocation is incorporated in ASBAL to compensate for the removal of a garbage collected heap. This facility allows list and graph structures to be built within the framework of the stack while preventing dangling references as a 'side-effect' of compile-time type checking. (Author). Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Parameters dtict Programming languages dtict Theses dtict Abstrakter Datentyp (DE-588)4120827-4 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Programmiersprache (DE-588)4047409-4 s DE-604 Abstrakter Datentyp (DE-588)4120827-4 s |
spellingShingle | Moss, John E. Abstract data types in stack based languages Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Parameters dtict Programming languages dtict Theses dtict Abstrakter Datentyp (DE-588)4120827-4 gnd Programmiersprache (DE-588)4047409-4 gnd |
subject_GND | (DE-588)4120827-4 (DE-588)4047409-4 |
title | Abstract data types in stack based languages |
title_auth | Abstract data types in stack based languages |
title_exact_search | Abstract data types in stack based languages |
title_exact_search_txtP | Abstract data types in stack based languages |
title_full | Abstract data types in stack based languages by John Eliot Blakeslee Moss |
title_fullStr | Abstract data types in stack based languages by John Eliot Blakeslee Moss |
title_full_unstemmed | Abstract data types in stack based languages by John Eliot Blakeslee Moss |
title_short | Abstract data types in stack based languages |
title_sort | abstract data types in stack based languages |
topic | Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Parameters dtict Programming languages dtict Theses dtict Abstrakter Datentyp (DE-588)4120827-4 gnd Programmiersprache (DE-588)4047409-4 gnd |
topic_facet | Computer Programming and Software Computer programming Computer programs Parameters Programming languages Theses Abstrakter Datentyp Programmiersprache |
work_keys_str_mv | AT mossjohne abstractdatatypesinstackbasedlanguages |