Formalized Metareasoning in Type Theory
| dc.contributor.author | Knoblock, Todd B. | en_US |
| dc.contributor.author | Constable, Robert L. | en_US |
| dc.date.accessioned | 2007-04-23T17:13:37Z | |
| dc.date.available | 2007-04-23T17:13:37Z | |
| dc.date.issued | 1986-03 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 1635637 bytes | |
| dc.format.extent | 530076 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-742 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6582 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Formalized Metareasoning in Type Theory | en_US |
| dc.type | technical report | en_US |