Constructing a calculus of programs:
Abstract: "A large part of the effort in formal program developments is expended on repeating the same derivational patterns over and over again. The problem is compounded by notations that require many marks on paper for expressing one elementary concept, and 'administrative overhead'...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,14 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A large part of the effort in formal program developments is expended on repeating the same derivational patterns over and over again. The problem is compounded by notations that require many marks on paper for expressing one elementary concept, and 'administrative overhead', consisting of algorithmically uninteresting but technically necessary steps, like shuffling parts of an expression around without change in computational meaning, and the introduction of local auxiliary definitions for lack of a suitable notation for what is being defined. This can to a large extent be avoided by developing suitable theories, including a notation that is designed to increase the manipulability After a reflexion on some of the issues, the more technical part of this paper is devoted to an attempt to construct a system of combinators that is better amendable to manipulation than the classical ones. |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245985 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)21502083 | ||
| 035 | |a (DE-599)BVBBV009245985 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Meertens, Lambert G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Constructing a calculus of programs |c L. G. L. T. Meertens |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 25 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 89,14 | |
| 520 | 3 | |a Abstract: "A large part of the effort in formal program developments is expended on repeating the same derivational patterns over and over again. The problem is compounded by notations that require many marks on paper for expressing one elementary concept, and 'administrative overhead', consisting of algorithmically uninteresting but technically necessary steps, like shuffling parts of an expression around without change in computational meaning, and the introduction of local auxiliary definitions for lack of a suitable notation for what is being defined. This can to a large extent be avoided by developing suitable theories, including a notation that is designed to increase the manipulability | |
| 520 | 3 | |a After a reflexion on some of the issues, the more technical part of this paper is devoted to an attempt to construct a system of combinators that is better amendable to manipulation than the classical ones. | |
| 650 | 4 | |a Calculus |x Computer programs | |
| 650 | 4 | |a Computer software |x Development | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,14 |w (DE-604)BV008928356 |9 89,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006152324 | ||
Datensatz im Suchindex
| _version_ | 1804123693263093760 |
|---|---|
| any_adam_object | |
| author | Meertens, Lambert G. |
| author_facet | Meertens, Lambert G. |
| author_role | aut |
| author_sort | Meertens, Lambert G. |
| author_variant | l g m lg lgm |
| building | Verbundindex |
| bvnumber | BV009245985 |
| ctrlnum | (OCoLC)21502083 (DE-599)BVBBV009245985 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01931nam a2200313 cb4500</leader><controlfield tag="001">BV009245985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21502083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245985</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">Meertens, Lambert G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constructing a calculus of programs</subfield><subfield code="c">L. G. L. T. Meertens</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 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">89,14</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A large part of the effort in formal program developments is expended on repeating the same derivational patterns over and over again. The problem is compounded by notations that require many marks on paper for expressing one elementary concept, and 'administrative overhead', consisting of algorithmically uninteresting but technically necessary steps, like shuffling parts of an expression around without change in computational meaning, and the introduction of local auxiliary definitions for lack of a suitable notation for what is being defined. This can to a large extent be avoided by developing suitable theories, including a notation that is designed to increase the manipulability</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">After a reflexion on some of the issues, the more technical part of this paper is devoted to an attempt to construct a system of combinators that is better amendable to manipulation than the classical ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus</subfield><subfield code="x">Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield><subfield code="x">Development</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">89,14</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152324</subfield></datafield></record></collection> |
| id | DE-604.BV009245985 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152324 |
| oclc_num | 21502083 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 25 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Meertens, Lambert G. Verfasser aut Constructing a calculus of programs L. G. L. T. Meertens Amsterdam 1989 25 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,14 Abstract: "A large part of the effort in formal program developments is expended on repeating the same derivational patterns over and over again. The problem is compounded by notations that require many marks on paper for expressing one elementary concept, and 'administrative overhead', consisting of algorithmically uninteresting but technically necessary steps, like shuffling parts of an expression around without change in computational meaning, and the introduction of local auxiliary definitions for lack of a suitable notation for what is being defined. This can to a large extent be avoided by developing suitable theories, including a notation that is designed to increase the manipulability After a reflexion on some of the issues, the more technical part of this paper is devoted to an attempt to construct a system of combinators that is better amendable to manipulation than the classical ones. Calculus Computer programs Computer software Development Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,14 (DE-604)BV008928356 89,14 |
| spellingShingle | Meertens, Lambert G. Constructing a calculus of programs Calculus Computer programs Computer software Development |
| title | Constructing a calculus of programs |
| title_auth | Constructing a calculus of programs |
| title_exact_search | Constructing a calculus of programs |
| title_full | Constructing a calculus of programs L. G. L. T. Meertens |
| title_fullStr | Constructing a calculus of programs L. G. L. T. Meertens |
| title_full_unstemmed | Constructing a calculus of programs L. G. L. T. Meertens |
| title_short | Constructing a calculus of programs |
| title_sort | constructing a calculus of programs |
| topic | Calculus Computer programs Computer software Development |
| topic_facet | Calculus Computer programs Computer software Development |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT meertenslambertg constructingacalculusofprograms |