
handle: 11336/28208
AbstractWe 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.
Logic of Proofs, https://purl.org/becyt/ford/1.2, Curry-Howard, Programming Languages, Lambda Calculus, https://purl.org/becyt/ford/1, Theoretical Computer Science, Computer Science(all)
Logic of Proofs, https://purl.org/becyt/ford/1.2, Curry-Howard, Programming Languages, Lambda Calculus, https://purl.org/becyt/ford/1, Theoretical Computer Science, Computer Science(all)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
