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)
Basic Proof Theory, A.S. Troelstra and H. Schwichtenberg
Journal of Logic, Language and Information
Explicit Substitutions for Constructive Necessity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
Justification logic and history based computation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Arithmetical Completeness of the Intuitionistic Logic of Proofs
Journal of Logic and Computation
History-based access control and secure information flow
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
| Hi-index | 0.00 |
We study a term assignment for an intuitonistic fragment of the Logic of Proofs (LP). LP is a refinement of modal logic S4 in which the assertion @?A is replaced by @?s@?A whose intended reading is ''s is a proof of A''. We first introduce a natural deduction presentation based on hypothetical judgements and then its term assignment, which yields a confluent and strongly normalising typed lambda calculus @l^I^H^L^P. This work is part of an ongoing effort towards reformulating LP in terms of hypothetical reasoning in order to explore its applications in programming languages.