First and second order lambda calculi with recursive types:
Recursive types are added to the first- and second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
764 |
| Schlagworte: | |
| Zusammenfassung: | Recursive types are added to the first- and second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types. |
| Beschreibung: | 28 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594898 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)15994368 | ||
| 035 | |a (DE-599)BVBBV010594898 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Mendler, N. P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a First and second order lambda calculi with recursive types |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 764 | |
| 520 | 3 | |a Recursive types are added to the first- and second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types. | |
| 650 | 4 | |a Lambda calculus | |
| 650 | 4 | |a Recursive functions | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 764 |w (DE-604)BV006185504 |9 764 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065454 | ||
Datensatz im Suchindex
| _version_ | 1804125066250682368 |
|---|---|
| any_adam_object | |
| author | Mendler, N. P. |
| author_facet | Mendler, N. P. |
| author_role | aut |
| author_sort | Mendler, N. P. |
| author_variant | n p m np npm |
| building | Verbundindex |
| bvnumber | BV010594898 |
| ctrlnum | (OCoLC)15994368 (DE-599)BVBBV010594898 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01222nam a2200301 cb4500</leader><controlfield tag="001">BV010594898</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15994368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594898</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mendler, N. P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">First and second order lambda calculi with recursive types</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">764</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Recursive types are added to the first- and second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">764</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">764</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065454</subfield></datafield></record></collection> |
| id | DE-604.BV010594898 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065454 |
| oclc_num | 15994368 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 28 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Mendler, N. P. Verfasser aut First and second order lambda calculi with recursive types Ithaca, New York 1986 28 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 764 Recursive types are added to the first- and second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types. Lambda calculus Recursive functions Department of Computer Science: Technical report Cornell University <Ithaca, NY> 764 (DE-604)BV006185504 764 |
| spellingShingle | Mendler, N. P. First and second order lambda calculi with recursive types Lambda calculus Recursive functions |
| title | First and second order lambda calculi with recursive types |
| title_auth | First and second order lambda calculi with recursive types |
| title_exact_search | First and second order lambda calculi with recursive types |
| title_full | First and second order lambda calculi with recursive types |
| title_fullStr | First and second order lambda calculi with recursive types |
| title_full_unstemmed | First and second order lambda calculi with recursive types |
| title_short | First and second order lambda calculi with recursive types |
| title_sort | first and second order lambda calculi with recursive types |
| topic | Lambda calculus Recursive functions |
| topic_facet | Lambda calculus Recursive functions |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT mendlernp firstandsecondorderlambdacalculiwithrecursivetypes |