Incorporating Quotation and Evaluation Into Church's Type Theory
arXiv:1612.02785 · doi:10.1016/j.ic.2018.03.001
Abstract
is a version of Church's type theory that includes quotation and evaluation operators that are similar to quote and eval in the Lisp programming language. With quotation and evaluation it is possible to reason in about the interplay of the syntax and semantics of expressions and, as a result, to formalize syntax-based mathematical algorithms. We present the syntax and semantics of as well as a proof system for . The proof system is shown to be sound for all formulas and complete for formulas that do not contain evaluations. We give several examples that illustrate the usefulness of having quotation and evaluation in .
arXiv comment74 pages
References in corpus (9)
- Tactics for Reasoning modulo AC in Coq
- Chiron: A Set Theory with Types, Undefinedness, Quotation, and Evaluation
- Frameworks for Reasoning about Syntax that Utilize Quotation and Evaluation
- On the Semantics of ReFLect as a Basis for a Reflective Theorem Prover
- On the Semantics of Intensionality and Intensional Recursion
- The Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation
- Modelling homogeneous generative meta-programming
- Theory Morphisms in Church's Type Theory with Quotation and Evaluation
- Simple Type Theory with Undefinedness, Quotation, and Evaluation