Abstract
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.
Work partially supported by ANPCyT PICT 2006-01216 and ITBA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alt, J., Artemov, S.: Reflective λ-calculus. In: Kahle, R., Schroeder-Heister, P., Stärk, R.F. (eds.) PTCS 2001. LNCS, vol. 2183, p. 22. Springer, Heidelberg (2001)
Artemov, S., Bonelli, E.: The intensional lambda calculus. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 12–25. Springer, Heidelberg (2007)
Abadi, M., Fournet, C.: Access control based on execution history. In: NDSS. The Internet Society (2003)
Artemov, S.: Operational modal logic. Technical Report MSI 95-29, Cornell University (1995)
Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)
Artemov, S.: Justification logic. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 1–4. Springer, Heidelberg (2008)
Barendregt, H.: Lambda Calculi with Types. In: Handbook of Logic in Computer Science. Oxford University Press, Oxford (1992)
Bonelli, E., Feller, F.: The logic of proofs as a foundation for certifying mobile computation. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 76–91. Springer, Heidelberg (2008)
Brezhnev, V.: On the logic of proofs. In: Proceedings of the Sixth ESSLLI Student Session, pp. 35–45 (2001)
Davies, R., Pfenning, F.: A modal analysis of staged computation. In: 23rd POPL, pp. 258–270. ACM Press, New York (1996)
Davies, R., Pfenning, F.: A judgmental reconstruction of modal logic. Journal of MSCS 11, 511–540 (2001)
Davies, R., Pfenning, F.: A modal analysis of staged computation. Journal of the ACM 48(3), 555–604 (2001)
Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with aprove. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)
Martin-Löf, P.: On the meaning of the logical constants and the justifications of the logical laws. Nordic J. of Philosophical Logic 1(1), 11–60 (1996)
Nanevski, A., Pfenning, F., Pientka, B.: Contextual modal type theory. ACM Trans. Comput. Log. 9(3) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bavera, F., Bonelli, E. (2010). Justification Logic and History Based Computation. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-14808-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14807-1
Online ISBN: 978-3-642-14808-8
eBook Packages: Computer ScienceComputer Science (R0)