LLFP : A Logical Framework for modeling External Evidence, Side Conditions, and Proof Irrelevance using Monads

Abstract : We extend the constructive dependent type theory of the Logical Framework LF with monadic, dependent type constructors indexed with predicates over judgements, called Locks. These monads capture various possible proof attitudes in establishing the judgment of the object logic encoded by an LF type. Standard examples are factoring-out the verification of a constraint or delegating it to an external oracle, or supplying some non-apodictic epistemic evidence, or simply discarding the proof witness of a precondition deeming it irrelevant. This new framework, called Lax Logical Framework, LLFP, is a conservative extension of LF, and hence it is the appropriate metalanguage for dealing formally with side-conditions in rules or external evidence in logical systems. LLFP arises once the monadic nature of the lock type-constructor, L^P_{M,σ}[-], introduced by the authors in a series of papers, together with Marina Lenisa, is fully exploited. The nature of the lock monads permits to utilize the very Lock destructor, U^P_{M,σ}[-], in place of Moggi’s monadic let_T, thus simplifying the equational theory. The rules for U^P_{M,σ}[-] permit also the removal of the monad once the constraint is satisfied. We derive the meta-theory of LLFP by a novel indirect method based on the encoding of LLFP in LF. We discuss encodings in LLFP of call-by-value λ-calculi, Hoare’s Logic, and Fitch-Prawitz Naive Set Theory.
Complete list of metadatas

https://hal.inria.fr/hal-01146059
Contributor : Luigi Liquori <>
Submitted on : Wednesday, March 15, 2017 - 3:20:39 PM
Last modification on : Thursday, February 7, 2019 - 3:15:40 PM
Long-term archiving on : Friday, June 16, 2017 - 2:12:22 PM

File

LLFP_LMCS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01146059, version 2
  • ARXIV : 1702.07214

Collections

Citation

Furio Honsell, Luigi Liquori, Petar Maksimovic, Ivan Scagnetto. LLFP : A Logical Framework for modeling External Evidence, Side Conditions, and Proof Irrelevance using Monads. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2017, Special Issue in honor of Pierre Louis Curien, ⟨http://www.lmcs-online.org/index.php⟩. ⟨hal-01146059v2⟩

Share

Metrics

Record views

623

Files downloads

158