A simplifier for untyped lambda expressions:
Abstract: "Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, partial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1990
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1337 |
| Subjects: | |
| Summary: | Abstract: "Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, partial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of automatic rewriting it is important to develop extensions of beta-value reduction and to develop methods for guaranteeing termination. This paper describes an extension of beta-value reduction and a method based on abstract interpretation for controlling rewriting to guarantee termination. The main innovations are (1) the use of rearrangement rules in combination with beta-value reduction to increase the power of the rewriting system and (2) the definition of a non-standard interpretation of expressions, the generates relation, as a basis for designing termination strategies for rewriting." |
| Physical Description: | 26 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973914 | ||
| 003 | DE-604 | ||
| 005 | 19991123 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24511373 | ||
| 035 | |a (DE-599)BVBBV008973914 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Galbiati, Louis |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A simplifier for untyped lambda expressions |c by Louis Galbiati ; Carolyn Talcott |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1337 | |
| 520 | 3 | |a Abstract: "Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, partial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of automatic rewriting it is important to develop extensions of beta-value reduction and to develop methods for guaranteeing termination. This paper describes an extension of beta-value reduction and a method based on abstract interpretation for controlling rewriting to guarantee termination. The main innovations are (1) the use of rearrangement rules in combination with beta-value reduction to increase the power of the rewriting system and (2) the definition of a non-standard interpretation of expressions, the generates relation, as a basis for designing termination strategies for rewriting." | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Lambda calculus | |
| 700 | 1 | |a Talcott, Carolyn L. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1337 |w (DE-604)BV008928280 |9 1337 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925565 | ||
Record in the Search Index
| _version_ | 1804123311888662528 |
|---|---|
| any_adam_object | |
| author | Galbiati, Louis Talcott, Carolyn L. |
| author_facet | Galbiati, Louis Talcott, Carolyn L. |
| author_role | aut aut |
| author_sort | Galbiati, Louis |
| author_variant | l g lg c l t cl clt |
| building | Verbundindex |
| bvnumber | BV008973914 |
| ctrlnum | (OCoLC)24511373 (DE-599)BVBBV008973914 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01900nam a2200313 cb4500</leader><controlfield tag="001">BV008973914</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19991123 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24511373</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973914</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">Galbiati, Louis</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A simplifier for untyped lambda expressions</subfield><subfield code="c">by Louis Galbiati ; Carolyn Talcott</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1337</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, partial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of automatic rewriting it is important to develop extensions of beta-value reduction and to develop methods for guaranteeing termination. This paper describes an extension of beta-value reduction and a method based on abstract interpretation for controlling rewriting to guarantee termination. The main innovations are (1) the use of rearrangement rules in combination with beta-value reduction to increase the power of the rewriting system and (2) the definition of a non-standard interpretation of expressions, the generates relation, as a basis for designing termination strategies for rewriting."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Talcott, Carolyn L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1337</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1337</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925565</subfield></datafield></record></collection> |
| id | DE-604.BV008973914 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925565 |
| oclc_num | 24511373 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 26 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Galbiati, Louis Verfasser aut A simplifier for untyped lambda expressions by Louis Galbiati ; Carolyn Talcott Stanford, Calif. 1990 26 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1337 Abstract: "Many applicative programming languages are based on the call-by-value lambda calculus. For these languages tools such as compilers, partial evaluators, and other transformation systems often make use of rewriting systems that incorporate some form of beta reduction. For purposes of automatic rewriting it is important to develop extensions of beta-value reduction and to develop methods for guaranteeing termination. This paper describes an extension of beta-value reduction and a method based on abstract interpretation for controlling rewriting to guarantee termination. The main innovations are (1) the use of rearrangement rules in combination with beta-value reduction to increase the power of the rewriting system and (2) the definition of a non-standard interpretation of expressions, the generates relation, as a basis for designing termination strategies for rewriting." Computer programming Lambda calculus Talcott, Carolyn L. Verfasser aut Computer Science Department: Report STAN CS Stanford University 1337 (DE-604)BV008928280 1337 |
| spellingShingle | Galbiati, Louis Talcott, Carolyn L. A simplifier for untyped lambda expressions Computer programming Lambda calculus |
| title | A simplifier for untyped lambda expressions |
| title_auth | A simplifier for untyped lambda expressions |
| title_exact_search | A simplifier for untyped lambda expressions |
| title_full | A simplifier for untyped lambda expressions by Louis Galbiati ; Carolyn Talcott |
| title_fullStr | A simplifier for untyped lambda expressions by Louis Galbiati ; Carolyn Talcott |
| title_full_unstemmed | A simplifier for untyped lambda expressions by Louis Galbiati ; Carolyn Talcott |
| title_short | A simplifier for untyped lambda expressions |
| title_sort | a simplifier for untyped lambda expressions |
| topic | Computer programming Lambda calculus |
| topic_facet | Computer programming Lambda calculus |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT galbiatilouis asimplifierforuntypedlambdaexpressions AT talcottcarolynl asimplifierforuntypedlambdaexpressions |