Coding binding and substitution explicitly in isabelle (1995)
| Venue: | University of Cambridge Computer Laboratory |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Owens95codingbinding,
author = {Christopher Owens},
title = {Coding binding and substitution explicitly in isabelle},
booktitle = {University of Cambridge Computer Laboratory},
year = {1995},
pages = {36--52}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Logical frameworks provide powerful methods of encoding object-logical binding and substitution using meta-logical λ-abstraction and application. However, there are some cases in which these methods are not general enough: in such cases object-logical binding and substitution must be explicitly coded. McKinna and Pollack [MP93] give a novel formalization of binding, where they use it principally to prove meta-theorems of Type Theory. We analyse the practical use of McKinna-Pollack binding in Isabelle object-logics, and illustrate its use with a simple example logic. 1
