scientific article; zbMATH DE number 432706
The author presents a modified type theory which he claims to be more convenient for reflection of proofs (in the sense of his joint work with \textit{S. F. Allen} and \textit{R. L. Constable} [``Reflecting the open-ended computation system of constructive type theory, in: Working Material, Int. Summer School on Logic, Algebra and Computation, Marktoberdorf, Germany, 1989] and with \textit{S. F. Allen}, \textit{R. L. Constable} and \textit{W. E. Aitken} [``The semantics of reflected proof, in: Proc. 5th Ann. IEEE Symp. on Logic and Computer Science, 95-107 (1990)]) than type theories in the lineage of Martin-Löf's polymorphic type theory and the type theory of the Nuprl proof development system. Within this modified theory, a direct formal account of its own semantics can be developed. The author shows in which way the presented type theory gives a simpler account of the reflected proof system developed in the cited papers. For the entire collection see [Zbl 0772.00018].
- Proof-theoretic analysis by iterated reflection
- Reflection in conditional rewriting logic
- Incorporating quotation and evaluation into Church's type theory
- Proof reflection in Coq
- Typing in reflective combinatory logic
- Computational reflection in the calculus of constructions and its application to theorem proving
- Reflective semantics of constructive type theory
- Reflection of formal tactics in a deductive reflection framework
- A Logic for Reflective ASMs
- Mtac: a monad for typed tactic programming in Coq
- On some semantic issues in the reflective tower
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138833)