A Formulation of the Simple Theory of Types (for Isabelle)
| dc.creator | Paulson, Lawrence C. | |
| dc.date | 2000-10-31 | |
| dc.date.accessioned | 2026-07-07T09:12:16Z | |
| dc.date.available | 2026-07-07T09:12:16Z | |
| dc.description | Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the Axiom of Choice. Higher-order logic is obtained through reflection between formulae and terms of type bool. Recursive types and functions can be formally constructed. Isabelle proof procedures are described. The logic appears suitable for general mathematics as well as computational problems. | |
| dc.identifier | https://arxiv.org/abs/cs/9301107 | |
| dc.identifier | http://arxiv.org/abs/cs/9301107 | |
| dc.identifier | published in P. Martin-Löf & G. Mints (editors), COLOG-88: International Conf. in Computer Logic (Springer LNCS 417, 1990), 246-274 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151964 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.1; F.4.1 | |
| dc.title | A Formulation of the Simple Theory of Types (for Isabelle) | |
| dc.type | text |