Reflecting higher-order abstract syntax in NuPRL (2002)
| Venue: | Theorem Proving in Higher Order Logics; Track B Proceedings of the 15 th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Barzilay02reflectinghigher-order,
author = {Eli Barzilay and Stuart Allen},
title = {Reflecting higher-order abstract syntax in NuPRL},
booktitle = {Theorem Proving in Higher Order Logics; Track B Proceedings of the 15 th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002},
year = {2002},
pages = {23--32}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This document describes part of an effort to achieve in Nuprl a practical reflection of its expression syntax. This reflection is done at the granularity of the operators; in particular, each operator of the syntax is denoted by another operator of the same syntax. Further, the syntax has binding operators, and we organize reflection not around the concrete binding syntax, but instead, around the abstract higher-order syntax. We formulate and prove the correctness of a core rule for inferring well-formedness of instances of operator-denoting operators. 1
Citations
| 269 | Higher-order abstract syntax - Pfenning, Elliott - 1988 |
| 194 | Revised5 report on the algorithmic language Scheme - Kelsey, Clinger, et al. - 1998 |
| 95 | On formally undecidable propositions of Principia Mathematica and related systems I. Monatshefte für Mathematik und Physik - Gödel - 1931 |
| 85 | The semantics of reflected proof - Allen, Constable, et al. - 1990 |
| 81 | A metalanguage for programming with bound names modulo renaming - Pitts, Gabbay - 2000 |
| 67 | Implementing Mathematics with the Nuprl Development System - Constable, Allen, et al. - 1986 |
| 55 | A non-type-theoretic semantics for type-theoretic language - Allen - 1987 |
| 9 | Implementing Reflection in Nuprl - Barzilay - 2006 |
