TY - JOUR
T1 - Intuitionistic Hypothetical Logic of Proofs
AU - Steren, Gabriela
AU - Bonelli, Eduardo
PY - 2014/1/21
Y1 - 2014/1/21
N2 - 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 λIHLP. 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.
AB - 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 λIHLP. 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.
KW - Curry-Howard
KW - Lambda Calculus
KW - Logic of Proofs
KW - Programming Languages
UR - http://www.scopus.com/inward/record.url?scp=84892184983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84892184983&partnerID=8YFLogxK
U2 - 10.1016/j.entcs.2013.12.013
DO - 10.1016/j.entcs.2013.12.013
M3 - Article
AN - SCOPUS:84892184983
SN - 1571-0661
VL - 300
SP - 89
EP - 103
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
ER -