A Conditional Logical Framework

Abstract : The Conditional Logical Framework LFK is a variant of the Harper-Honsell-Plotkin's Edinburgh Logical Framemork LF. It features a generalized form of λ-abstraction where β-reductions fire under the condition that the argument satisfies a logical predicate. The key idea is that the type system memorizes under what conditions and where reductions have yet to fire. Different notions of β-reductions corresponding to different predicates can be combined in LFK. The framework LFK subsumes, by simple instantiation, LF (in fact, it is also a sub-system of LF!), as well as a large class of new generalized conditional λ-calculi. These are appropriate to deal smoothly with the side-conditions of both Hilbert and Natural Deduction presentations of Modal Logics. We investigate and characterize the metatheoretical properties of the calculus underpinning LFK, such as subject reduction, confluence, strong normalization.
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00909574
Contributor : Luigi Liquori <>
Submitted on : Tuesday, November 26, 2013 - 2:40:42 PM
Last modification on : Saturday, January 27, 2018 - 1:30:57 AM
Document(s) archivé(s) le : Thursday, February 27, 2014 - 9:55:17 AM

File

lpar-08.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Luigi Liquori, Furio Honsell, Marina Lenisa, Ivan Scagnetto. A Conditional Logical Framework. Logic for Programming, Artificial Intelligence, and Reasoning 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, Nov 2008, Doha, Qatar. pp.143-157, ⟨10.1007/978-3-540-89439-1_10⟩. ⟨hal-00909574⟩

Share

Metrics

Record views

180

Files downloads

88