J-Calc: a typed lambda calculus for intuitionistic justification logic

Pouliasis, Konstantinos and Primiero, Giuseppe (2014) J-Calc: a typed lambda calculus for intuitionistic justification logic. Electronic Notes in Theoretical Computer Science, 300 . pp. 71-87. ISSN 1571-0661 [Article] (doi:10.1016/j.entcs.2013.12.012)

[img]
Preview
PDF - First submitted uncorrected version (with author's formatting)
Download (362kB) | Preview

Abstract

In this paper we offer a system J-Calc that can be regarded as a typed λ-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

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 13947
Depositing User: Giuseppe Primiero
Date Deposited: 28 Nov 2014 14:02
Last Modified: 03 Apr 2019 17:25
URI: https://eprints.mdx.ac.uk/id/eprint/13947

Actions (login required)

View Item View Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year