A model and stack implementation of multiple environments:
Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Massachusetts
1972
|
Schriftenreihe: | Center for Research in Computing Technology <Cambridge, Mass.>: TR
1972,7 |
Schlagworte: | |
Zusammenfassung: | Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in both time and space. The paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multi-tasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. (Author). |
Beschreibung: | III, 57 Bl. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009778169 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940829s1972 |||| 00||| engod | ||
035 | |a (OCoLC)227662262 | ||
035 | |a (DE-599)BVBBV009778169 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Bobrow, Daniel Gureasko |e Verfasser |0 (DE-588)126953546 |4 aut | |
245 | 1 | 0 | |a A model and stack implementation of multiple environments |c by Daniel G. Bobrow ; Ben Wegbreit |
264 | 1 | |a Cambridge, Massachusetts |c 1972 | |
300 | |a III, 57 Bl. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Center for Research in Computing Technology <Cambridge, Mass.>: TR |v 1972,7 | |
520 | 3 | |a Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in both time and space. The paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multi-tasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. (Author). | |
650 | 4 | |a MULTIPROCESSING | |
650 | 4 | |a PARALLEL PROCESSORS | |
650 | 7 | |a Computer Hardware |2 scgdst | |
650 | 7 | |a Computer Programming and Software |2 scgdst | |
650 | 7 | |a Control sequences |2 dtict | |
650 | 7 | |a Linguistics |2 dtict | |
650 | 7 | |a Programming languages |2 dtict | |
650 | 4 | |a Linguistik | |
700 | 1 | |a Wegbreit, Ben |e Verfasser |4 aut | |
830 | 0 | |a Center for Research in Computing Technology <Cambridge, Mass.>: TR |v 1972,7 |w (DE-604)BV008910570 |9 1972,7 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006470076 |
Datensatz im Suchindex
_version_ | 1804124127400820736 |
---|---|
any_adam_object | |
author | Bobrow, Daniel Gureasko Wegbreit, Ben |
author_GND | (DE-588)126953546 |
author_facet | Bobrow, Daniel Gureasko Wegbreit, Ben |
author_role | aut aut |
author_sort | Bobrow, Daniel Gureasko |
author_variant | d g b dg dgb b w bw |
building | Verbundindex |
bvnumber | BV009778169 |
ctrlnum | (OCoLC)227662262 (DE-599)BVBBV009778169 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02100nam a2200373 cb4500</leader><controlfield tag="001">BV009778169</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940829s1972 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227662262</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009778169</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">Bobrow, Daniel Gureasko</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)126953546</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A model and stack implementation of multiple environments</subfield><subfield code="c">by Daniel G. Bobrow ; Ben Wegbreit</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 57 Bl.</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">Center for Research in Computing Technology <Cambridge, Mass.>: TR</subfield><subfield code="v">1972,7</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in both time and space. The paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multi-tasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MULTIPROCESSING</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PARALLEL PROCESSORS</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</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">Control sequences</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</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="4"><subfield code="a">Linguistik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wegbreit, Ben</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Research in Computing Technology <Cambridge, Mass.>: TR</subfield><subfield code="v">1972,7</subfield><subfield code="w">(DE-604)BV008910570</subfield><subfield code="9">1972,7</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006470076</subfield></datafield></record></collection> |
id | DE-604.BV009778169 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:40:43Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006470076 |
oclc_num | 227662262 |
open_access_boolean | |
physical | III, 57 Bl. |
publishDate | 1972 |
publishDateSearch | 1972 |
publishDateSort | 1972 |
record_format | marc |
series | Center for Research in Computing Technology <Cambridge, Mass.>: TR |
series2 | Center for Research in Computing Technology <Cambridge, Mass.>: TR |
spelling | Bobrow, Daniel Gureasko Verfasser (DE-588)126953546 aut A model and stack implementation of multiple environments by Daniel G. Bobrow ; Ben Wegbreit Cambridge, Massachusetts 1972 III, 57 Bl. txt rdacontent n rdamedia nc rdacarrier Center for Research in Computing Technology <Cambridge, Mass.>: TR 1972,7 Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in both time and space. The paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multi-tasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. (Author). MULTIPROCESSING PARALLEL PROCESSORS Computer Hardware scgdst Computer Programming and Software scgdst Control sequences dtict Linguistics dtict Programming languages dtict Linguistik Wegbreit, Ben Verfasser aut Center for Research in Computing Technology <Cambridge, Mass.>: TR 1972,7 (DE-604)BV008910570 1972,7 |
spellingShingle | Bobrow, Daniel Gureasko Wegbreit, Ben A model and stack implementation of multiple environments Center for Research in Computing Technology <Cambridge, Mass.>: TR MULTIPROCESSING PARALLEL PROCESSORS Computer Hardware scgdst Computer Programming and Software scgdst Control sequences dtict Linguistics dtict Programming languages dtict Linguistik |
title | A model and stack implementation of multiple environments |
title_auth | A model and stack implementation of multiple environments |
title_exact_search | A model and stack implementation of multiple environments |
title_full | A model and stack implementation of multiple environments by Daniel G. Bobrow ; Ben Wegbreit |
title_fullStr | A model and stack implementation of multiple environments by Daniel G. Bobrow ; Ben Wegbreit |
title_full_unstemmed | A model and stack implementation of multiple environments by Daniel G. Bobrow ; Ben Wegbreit |
title_short | A model and stack implementation of multiple environments |
title_sort | a model and stack implementation of multiple environments |
topic | MULTIPROCESSING PARALLEL PROCESSORS Computer Hardware scgdst Computer Programming and Software scgdst Control sequences dtict Linguistics dtict Programming languages dtict Linguistik |
topic_facet | MULTIPROCESSING PARALLEL PROCESSORS Computer Hardware Computer Programming and Software Control sequences Linguistics Programming languages Linguistik |
volume_link | (DE-604)BV008910570 |
work_keys_str_mv | AT bobrowdanielgureasko amodelandstackimplementationofmultipleenvironments AT wegbreitben amodelandstackimplementationofmultipleenvironments |