J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic

Authors:
Konstantinos Pouliasis;Giuseppe Primiero
Affiliations:
-;-
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2014

Citing 11
Cited 0

Proofs and types

Proofs and types
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
An Introduction to Dependent Type Theory

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A judgmental reconstruction of modal logic

Mathematical Structures in Computer Science
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Contextual modal type theory

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

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Kripke Semantics for Martin-Löf's Extensional Type Theory

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Dependently typed programming in Agda

AFP'08 Proceedings of the 6th international conference on Advanced functional programming
The Ontology of Justifications in the Logical Setting

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we offer a system J-Calc that can be regarded as a typed @l-calculus for the {-,@?} fragment of Intuitionistic Justification Logic. We offer different interpretations of J-Calc, in particular, as a two phase proof system in which we proof check the validity of deductions of a theory T based on deductions from a stronger theory T^' and computationally as a type system for separate compilations. We establish some first metatheoretic results.