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
A modal analysis of staged computation
Journal of the ACM (JACM)
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
ACM Transactions on Computational Logic (TOCL)
The Intensional Lambda Calculus
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
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
Intuitionistic Hypothetical Logic of Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
Justification Logic (JL) is a refinement of modal logic that has recently been proposed for explaining well-known paradoxes arising in the formalization of Epistemic Logic. Assertions of knowledge and belief are accompanied by justifications: the formula [t]A states that t is "reason" for knowing/believing A. We study the computational interpretation of JL via the Curry-de Bruijn-Howard isomorphism in which the modality [t]A is interpreted as: t is a type derivation justifying the validity of A. The resulting lambda calculus is such that its terms are aware of the reduction sequence that gave rise to them. This serves as a basis for understanding systems, many of which belong to the security domain, in which computation is history-aware.