LaxLF: Side Conditions and External Evidence as Monads - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

LaxLF: Side Conditions and External Evidence as Monads


We extend the constructive dependent type theory of the Logical Framework LF with a family of monads indexed by predicates over typed terms. These monads express the effect of factoring-out, postponing , or delegating to an external oracle the verification of a constraint or a side-condition. This new framework, called Lax Logical Framework, LaxF, is a conservative extension of LF, and hence it is the appropriate metalanguage for dealing formally with side-conditions or external evidence in logical systems. LaxF is the natural strengthening of LFP (the extension of LF introduced by the authors together with Marina Lenisa and Petar Maksimovic), which arises once the monadic nature of the lock constructors of LFP is fully exploited. The nature of these monads allows to utilize the unlock destructor instead of Moggi's monadic let_T , thus simplifying the equational theory. The rules for the unlock allow us, furthermore, to remove the monadic constructor once the constraint is satisfied. By way of example we discuss the encodings in LaxF of call-by-value-calculus, Hoare's Logic, and Elementary Affine Logic.
Fichier principal
Vignette du fichier
mfcs-14.pdf (761.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01146023 , version 1 (27-04-2015)



Furio Honsell, Luigi Liquori, Ivan Scagnetto. LaxLF: Side Conditions and External Evidence as Monads. Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I., Aug 2014, Budapest, Hungary. pp.327-339, ⟨10.1007/978-3-662-44522-8_28⟩. ⟨hal-01146023⟩


102 View
94 Download



Gmail Facebook Twitter LinkedIn More