Proofs and types
Handbook of logic in computer science (vol. 2)
A modal analysis of staged computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal types as staging specifications for run-time code generation
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Perpetuality and uniform normalization in orthogonal rewrite systems
Information and Computation
A modal analysis of staged computation
Journal of the ACM (JACM)
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
The Logic of Proofs as a Foundation for Certifying Mobile Computation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Justification logic and history based computation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Reflections on trust: trust assurance by dynamic discovery of static properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Intuitionistic Hypothetical Logic of Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4in which the assertion 驴 A is replaced by [[s]]Awhose intended reading is "s is a proof of A". A term calculus for this formulation yields a typed lambda calculus 驴Ithat internalises intensionalinformation on howa term is computed. In the same way that the Logic of Proofs internalises its own derivations, 驴Iinternalises its own computations. Confluence and strong normalisation of 驴Iis proved. This system serves as the basis for the study of type theories that internalise intensional aspects of computation.