On normalisation:
Abstract: "Using a characterisation of strongly normalising [lambda]-terms, we give new and simple proofs of the followings: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply t...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,45 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Using a characterisation of strongly normalising [lambda]-terms, we give new and simple proofs of the followings: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply typed [lambda]-calculus is strongly normalising. |
| Beschreibung: | 33 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011063586 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961115s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34292311 | ||
| 035 | |a (DE-599)BVBBV011063586 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Raamsdonk, Femke van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On normalisation |c F. van Raamsdonk ; P. Severi |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 33 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,45 | |
| 520 | 3 | |a Abstract: "Using a characterisation of strongly normalising [lambda]-terms, we give new and simple proofs of the followings: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply typed [lambda]-calculus is strongly normalising. | |
| 650 | 4 | |a Lambda calculus | |
| 700 | 1 | |a Severi, Paula |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,45 |w (DE-604)BV008928356 |9 95,45 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007409662 | ||
Datensatz im Suchindex
| _version_ | 1804125552581279744 |
|---|---|
| any_adam_object | |
| author | Raamsdonk, Femke van Severi, Paula |
| author_facet | Raamsdonk, Femke van Severi, Paula |
| author_role | aut aut |
| author_sort | Raamsdonk, Femke van |
| author_variant | f v r fv fvr p s ps |
| building | Verbundindex |
| bvnumber | BV011063586 |
| ctrlnum | (OCoLC)34292311 (DE-599)BVBBV011063586 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01302nam a2200289 cb4500</leader><controlfield tag="001">BV011063586</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)34292311</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011063586</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">Raamsdonk, Femke van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On normalisation</subfield><subfield code="c">F. van Raamsdonk ; P. Severi</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">33 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,45</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Using a characterisation of strongly normalising [lambda]-terms, we give new and simple proofs of the followings: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply typed [lambda]-calculus is strongly normalising.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Severi, Paula</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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,45</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,45</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007409662</subfield></datafield></record></collection> |
| id | DE-604.BV011063586 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:22Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007409662 |
| oclc_num | 34292311 |
| open_access_boolean | |
| physical | 33 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Raamsdonk, Femke van Verfasser aut On normalisation F. van Raamsdonk ; P. Severi Amsterdam 1995 33 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,45 Abstract: "Using a characterisation of strongly normalising [lambda]-terms, we give new and simple proofs of the followings: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply typed [lambda]-calculus is strongly normalising. Lambda calculus Severi, Paula Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,45 (DE-604)BV008928356 95,45 |
| spellingShingle | Raamsdonk, Femke van Severi, Paula On normalisation Lambda calculus |
| title | On normalisation |
| title_auth | On normalisation |
| title_exact_search | On normalisation |
| title_full | On normalisation F. van Raamsdonk ; P. Severi |
| title_fullStr | On normalisation F. van Raamsdonk ; P. Severi |
| title_full_unstemmed | On normalisation F. van Raamsdonk ; P. Severi |
| title_short | On normalisation |
| title_sort | on normalisation |
| topic | Lambda calculus |
| topic_facet | Lambda calculus |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT raamsdonkfemkevan onnormalisation AT severipaula onnormalisation |