Formalized metareasoning in type theory:
In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we s...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
742 |
| Schlagworte: | |
| Zusammenfassung: | In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we sketch that construction. The second approach depends on a particular metatheorem that justifies partial reflection, and we outline this proof. We also illustrate the construction of simple metatheoretic functions, tactics, in Nuprl. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594353 | ||
| 003 | DE-604 | ||
| 005 | 20200630 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)14556576 | ||
| 035 | |a (DE-599)BVBBV010594353 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Knoblock, Todd B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Formalized metareasoning in type theory |c Todd B. Knoblock ; Robert L. Constable |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 12 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 742 | |
| 520 | 3 | |a In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we sketch that construction. The second approach depends on a particular metatheorem that justifies partial reflection, and we outline this proof. We also illustrate the construction of simple metatheoretic functions, tactics, in Nuprl. | |
| 650 | 4 | |a Type theory | |
| 650 | 4 | |a Problem solving | |
| 650 | 4 | |a Reasoning | |
| 700 | 1 | |a Constable, Robert Lee |d 1952- |e Verfasser |0 (DE-588)1089583133 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 742 |w (DE-604)BV006185504 |9 742 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007064983 | ||
Datensatz im Suchindex
| _version_ | 1804125065595322368 |
|---|---|
| any_adam_object | |
| author | Knoblock, Todd B. Constable, Robert Lee 1952- |
| author_GND | (DE-588)1089583133 |
| author_facet | Knoblock, Todd B. Constable, Robert Lee 1952- |
| author_role | aut aut |
| author_sort | Knoblock, Todd B. |
| author_variant | t b k tb tbk r l c rl rlc |
| building | Verbundindex |
| bvnumber | BV010594353 |
| ctrlnum | (OCoLC)14556576 (DE-599)BVBBV010594353 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01615nam a2200325 cb4500</leader><controlfield tag="001">BV010594353</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200630 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14556576</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594353</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">Knoblock, Todd B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formalized metareasoning in type theory</subfield><subfield code="c">Todd B. Knoblock ; Robert L. Constable</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">12 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">742</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we sketch that construction. The second approach depends on a particular metatheorem that justifies partial reflection, and we outline this proof. We also illustrate the construction of simple metatheoretic functions, tactics, in Nuprl.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Type theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problem solving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Constable, Robert Lee</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089583133</subfield><subfield code="4">aut</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">742</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">742</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007064983</subfield></datafield></record></collection> |
| id | DE-604.BV010594353 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007064983 |
| oclc_num | 14556576 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Knoblock, Todd B. Verfasser aut Formalized metareasoning in type theory Todd B. Knoblock ; Robert L. Constable Ithaca, New York 1986 12 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 742 In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we sketch that construction. The second approach depends on a particular metatheorem that justifies partial reflection, and we outline this proof. We also illustrate the construction of simple metatheoretic functions, tactics, in Nuprl. Type theory Problem solving Reasoning Constable, Robert Lee 1952- Verfasser (DE-588)1089583133 aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 742 (DE-604)BV006185504 742 |
| spellingShingle | Knoblock, Todd B. Constable, Robert Lee 1952- Formalized metareasoning in type theory Type theory Problem solving Reasoning |
| title | Formalized metareasoning in type theory |
| title_auth | Formalized metareasoning in type theory |
| title_exact_search | Formalized metareasoning in type theory |
| title_full | Formalized metareasoning in type theory Todd B. Knoblock ; Robert L. Constable |
| title_fullStr | Formalized metareasoning in type theory Todd B. Knoblock ; Robert L. Constable |
| title_full_unstemmed | Formalized metareasoning in type theory Todd B. Knoblock ; Robert L. Constable |
| title_short | Formalized metareasoning in type theory |
| title_sort | formalized metareasoning in type theory |
| topic | Type theory Problem solving Reasoning |
| topic_facet | Type theory Problem solving Reasoning |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT knoblocktoddb formalizedmetareasoningintypetheory AT constablerobertlee formalizedmetareasoningintypetheory |