Fine-grain incremental implementation of algebraic specifications:
Abstract: "Considering symbol tables as aggregate values often forms an obstacle to incremental type checking or evaluation of programs. A small change in a symbol table requires many expensive re-calculations of values that depend on (part of) the symbol table. In a previous paper we described...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,59 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Considering symbol tables as aggregate values often forms an obstacle to incremental type checking or evaluation of programs. A small change in a symbol table requires many expensive re-calculations of values that depend on (part of) the symbol table. In a previous paper we described how an incremental implementation can be derived from algebraic specifications belonging to the subclass of well-presented primitive recursive schemes. Type check specifications typically belong to this class. In this paper we generalize this incremental implementation method to functions on values of auxiliary data types like symbol tables. Thus we obtain fine-grain incremental implementations This fine-grain incrementality can be derived from a subclass of algebraic specifications that we will call layered primitive recursive schemes. |
| Beschreibung: | 23 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993177 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27471556 | ||
| 035 | |a (DE-599)BVBBV008993177 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Meulen, E. A. van der |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fine-grain incremental implementation of algebraic specifications |c E. A. van der Meulen |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 23 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 91,59 | |
| 520 | 3 | |a Abstract: "Considering symbol tables as aggregate values often forms an obstacle to incremental type checking or evaluation of programs. A small change in a symbol table requires many expensive re-calculations of values that depend on (part of) the symbol table. In a previous paper we described how an incremental implementation can be derived from algebraic specifications belonging to the subclass of well-presented primitive recursive schemes. Type check specifications typically belong to this class. In this paper we generalize this incremental implementation method to functions on values of auxiliary data types like symbol tables. Thus we obtain fine-grain incremental implementations | |
| 520 | 3 | |a This fine-grain incrementality can be derived from a subclass of algebraic specifications that we will call layered primitive recursive schemes. | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 650 | 4 | |a Software engineering | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,59 |w (DE-604)BV008928356 |9 91,59 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005942000 | ||
Datensatz im Suchindex
| _version_ | 1804123335695532032 |
|---|---|
| any_adam_object | |
| author | Meulen, E. A. van der |
| author_facet | Meulen, E. A. van der |
| author_role | aut |
| author_sort | Meulen, E. A. van der |
| author_variant | e a v d m eavd eavdm |
| building | Verbundindex |
| bvnumber | BV008993177 |
| ctrlnum | (OCoLC)27471556 (DE-599)BVBBV008993177 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01946nam a2200325 cb4500</leader><controlfield tag="001">BV008993177</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27471556</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993177</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meulen, E. A. van der</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fine-grain incremental implementation of algebraic specifications</subfield><subfield code="c">E. A. van der Meulen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,59</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Considering symbol tables as aggregate values often forms an obstacle to incremental type checking or evaluation of programs. A small change in a symbol table requires many expensive re-calculations of values that depend on (part of) the symbol table. In a previous paper we described how an incremental implementation can be derived from algebraic specifications belonging to the subclass of well-presented primitive recursive schemes. Type check specifications typically belong to this class. In this paper we generalize this incremental implementation method to functions on values of auxiliary data types like symbol tables. Thus we obtain fine-grain incremental implementations</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This fine-grain incrementality can be derived from a subclass of algebraic specifications that we will call layered primitive recursive schemes.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">91,59</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,59</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942000</subfield></datafield></record></collection> |
| id | DE-604.BV008993177 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942000 |
| oclc_num | 27471556 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 23 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Meulen, E. A. van der Verfasser aut Fine-grain incremental implementation of algebraic specifications E. A. van der Meulen Amsterdam 1991 23 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,59 Abstract: "Considering symbol tables as aggregate values often forms an obstacle to incremental type checking or evaluation of programs. A small change in a symbol table requires many expensive re-calculations of values that depend on (part of) the symbol table. In a previous paper we described how an incremental implementation can be derived from algebraic specifications belonging to the subclass of well-presented primitive recursive schemes. Type check specifications typically belong to this class. In this paper we generalize this incremental implementation method to functions on values of auxiliary data types like symbol tables. Thus we obtain fine-grain incremental implementations This fine-grain incrementality can be derived from a subclass of algebraic specifications that we will call layered primitive recursive schemes. Abstract data types (Computer science) Rewriting systems (Computer science) Software engineering Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,59 (DE-604)BV008928356 91,59 |
| spellingShingle | Meulen, E. A. van der Fine-grain incremental implementation of algebraic specifications Abstract data types (Computer science) Rewriting systems (Computer science) Software engineering |
| title | Fine-grain incremental implementation of algebraic specifications |
| title_auth | Fine-grain incremental implementation of algebraic specifications |
| title_exact_search | Fine-grain incremental implementation of algebraic specifications |
| title_full | Fine-grain incremental implementation of algebraic specifications E. A. van der Meulen |
| title_fullStr | Fine-grain incremental implementation of algebraic specifications E. A. van der Meulen |
| title_full_unstemmed | Fine-grain incremental implementation of algebraic specifications E. A. van der Meulen |
| title_short | Fine-grain incremental implementation of algebraic specifications |
| title_sort | fine grain incremental implementation of algebraic specifications |
| topic | Abstract data types (Computer science) Rewriting systems (Computer science) Software engineering |
| topic_facet | Abstract data types (Computer science) Rewriting systems (Computer science) Software engineering |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT meuleneavander finegrainincrementalimplementationofalgebraicspecifications |