Towards a proof theory of rewriting: the simply-typed 2-lambda calculus
Abstract: "This paper describes the simply-typed 2-[lambda]- calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply-typed [lambda]-calculus, and the rewrites are expressions denoting sequences of [beta]-reductions and [eta]- expansions. An...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1994
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
336 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper describes the simply-typed 2-[lambda]- calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply-typed [lambda]-calculus, and the rewrites are expressions denoting sequences of [beta]-reductions and [eta]- expansions. An equational theory is imposed on the rewrites, based on 2- categorical justifications, and the word problem for this theory is solved by finding a canonical expression in each equivalence class. The canonical form of rewrites allows us to prove several properties of the calculus, including a strong form of confluence and a classification of the long-[beta]-[eta]-normal forms in terms of their rewrites. Finally we use these properties as the basic definitions of a theory of categorical rewriting, and find that the expected relationships between confluence, strong normalisation and normal forms hold." |
| Beschreibung: | 28 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010413423 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951009s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)32079664 | ||
| 035 | |a (DE-599)BVBBV010413423 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Hilken, Barnaby P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Towards a proof theory of rewriting |b the simply-typed 2-lambda calculus |
| 264 | 1 | |a Cambridge |c 1994 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 336 | |
| 520 | 3 | |a Abstract: "This paper describes the simply-typed 2-[lambda]- calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply-typed [lambda]-calculus, and the rewrites are expressions denoting sequences of [beta]-reductions and [eta]- expansions. An equational theory is imposed on the rewrites, based on 2- categorical justifications, and the word problem for this theory is solved by finding a canonical expression in each equivalence class. The canonical form of rewrites allows us to prove several properties of the calculus, including a strong form of confluence and a classification of the long-[beta]-[eta]-normal forms in terms of their rewrites. Finally we use these properties as the basic definitions of a theory of categorical rewriting, and find that the expected relationships between confluence, strong normalisation and normal forms hold." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Proof theory | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 336 |w (DE-604)BV004055605 |9 336 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006935150 | ||
Datensatz im Suchindex
| _version_ | 1804124842312597504 |
|---|---|
| any_adam_object | |
| author | Hilken, Barnaby P. |
| author_facet | Hilken, Barnaby P. |
| author_role | aut |
| author_sort | Hilken, Barnaby P. |
| author_variant | b p h bp bph |
| building | Verbundindex |
| bvnumber | BV010413423 |
| ctrlnum | (OCoLC)32079664 (DE-599)BVBBV010413423 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01849nam a2200301 cb4500</leader><controlfield tag="001">BV010413423</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951009s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32079664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010413423</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">Hilken, Barnaby P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Towards a proof theory of rewriting</subfield><subfield code="b">the simply-typed 2-lambda calculus</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1994</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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">336</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper describes the simply-typed 2-[lambda]- calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply-typed [lambda]-calculus, and the rewrites are expressions denoting sequences of [beta]-reductions and [eta]- expansions. An equational theory is imposed on the rewrites, based on 2- categorical justifications, and the word problem for this theory is solved by finding a canonical expression in each equivalence class. The canonical form of rewrites allows us to prove several properties of the calculus, including a strong form of confluence and a classification of the long-[beta]-[eta]-normal forms in terms of their rewrites. Finally we use these properties as the basic definitions of a theory of categorical rewriting, and find that the expected relationships between confluence, strong normalisation and normal forms hold."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">336</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">336</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006935150</subfield></datafield></record></collection> |
| id | DE-604.BV010413423 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:05Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006935150 |
| oclc_num | 32079664 |
| open_access_boolean | |
| physical | 28 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Hilken, Barnaby P. Verfasser aut Towards a proof theory of rewriting the simply-typed 2-lambda calculus Cambridge 1994 28 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 336 Abstract: "This paper describes the simply-typed 2-[lambda]- calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply-typed [lambda]-calculus, and the rewrites are expressions denoting sequences of [beta]-reductions and [eta]- expansions. An equational theory is imposed on the rewrites, based on 2- categorical justifications, and the word problem for this theory is solved by finding a canonical expression in each equivalence class. The canonical form of rewrites allows us to prove several properties of the calculus, including a strong form of confluence and a classification of the long-[beta]-[eta]-normal forms in terms of their rewrites. Finally we use these properties as the basic definitions of a theory of categorical rewriting, and find that the expected relationships between confluence, strong normalisation and normal forms hold." Applied statistics, operational research sigle Computer software sigle Proof theory Computer Laboratory <Cambridge>: Technical report 336 (DE-604)BV004055605 336 |
| spellingShingle | Hilken, Barnaby P. Towards a proof theory of rewriting the simply-typed 2-lambda calculus Computer Laboratory <Cambridge>: Technical report Applied statistics, operational research sigle Computer software sigle Proof theory |
| title | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_auth | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_exact_search | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_full | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_fullStr | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_full_unstemmed | Towards a proof theory of rewriting the simply-typed 2-lambda calculus |
| title_short | Towards a proof theory of rewriting |
| title_sort | towards a proof theory of rewriting the simply typed 2 lambda calculus |
| title_sub | the simply-typed 2-lambda calculus |
| topic | Applied statistics, operational research sigle Computer software sigle Proof theory |
| topic_facet | Applied statistics, operational research Computer software Proof theory |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT hilkenbarnabyp towardsaprooftheoryofrewritingthesimplytyped2lambdacalculus |