<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pouliasis, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">J-Calc: A typed lambda calculus for Intuitionistic Justification Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><volume><style face="normal" font="default" size="100%">300</style></volume><pages><style face="normal" font="default" size="100%">71–87</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we offer a system J-Calc that can be regarded as a typed λ -calculus for the {→,&amp;amp;\#8869;} 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 Τ based on deductions from a stronger theory Τ' and computationally as a type system for separate compilations. We establish some first metatheoretic results.&lt;/p&gt;</style></abstract></record></records></xml>