Infinitary lambda calculus:
Abstract: "In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infin...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,35 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Böhm-like models, which embody different notions of lazy or eager computation." |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011063072 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961115s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)33852724 | ||
| 035 | |a (DE-599)BVBBV011063072 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 245 | 1 | 0 | |a Infinitary lambda calculus |c J. R. Kennaway ... |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 15 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 95,35 | |
| 520 | 3 | |a Abstract: "In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Böhm-like models, which embody different notions of lazy or eager computation." | |
| 650 | 4 | |a Lambda calculus | |
| 700 | 1 | |a Kennaway, J. R. |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,35 |w (DE-604)BV008928356 |9 95,35 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007409223 | ||
Datensatz im Suchindex
| _version_ | 1804125551778070528 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV011063072 |
| ctrlnum | (OCoLC)33852724 (DE-599)BVBBV011063072 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01425nam a2200277 cb4500</leader><controlfield tag="001">BV011063072</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961115s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33852724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011063072</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="245" ind1="1" ind2="0"><subfield code="a">Infinitary lambda calculus</subfield><subfield code="c">J. R. Kennaway ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">95,35</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Böhm-like models, which embody different notions of lazy or eager computation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kennaway, J. R.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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">95,35</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,35</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007409223</subfield></datafield></record></collection> |
| id | DE-604.BV011063072 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:22Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007409223 |
| oclc_num | 33852724 |
| open_access_boolean | |
| physical | 15 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Infinitary lambda calculus J. R. Kennaway ... Amsterdam 1995 15 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,35 Abstract: "In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Böhm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Böhm-like models, which embody different notions of lazy or eager computation." Lambda calculus Kennaway, J. R. Sonstige oth Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,35 (DE-604)BV008928356 95,35 |
| spellingShingle | Infinitary lambda calculus Lambda calculus |
| title | Infinitary lambda calculus |
| title_auth | Infinitary lambda calculus |
| title_exact_search | Infinitary lambda calculus |
| title_full | Infinitary lambda calculus J. R. Kennaway ... |
| title_fullStr | Infinitary lambda calculus J. R. Kennaway ... |
| title_full_unstemmed | Infinitary lambda calculus J. R. Kennaway ... |
| title_short | Infinitary lambda calculus |
| title_sort | infinitary lambda calculus |
| topic | Lambda calculus |
| topic_facet | Lambda calculus |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kennawayjr infinitarylambdacalculus |