{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:25Z","timestamp":1772242045418,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:00:00Z","timestamp":1499299200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:00:00Z","timestamp":1499299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:00:00Z","timestamp":1499299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We extend the constructive dependent type theory of the Logical Framework $\\mathsf{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 $\\mathsf{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, $\\mathsf{LLF}_{\\cal P}$, is a conservative extension of $\\mathsf{LF}$, and hence it is the appropriate metalanguage for dealing formally with side-conditions in rules or external evidence in logical systems. $\\mathsf{LLF}_{\\cal P}$ arises once the monadic nature of the lock type-constructor, ${\\cal L}^{\\cal P}_{M,\\sigma}[\\cdot]$, 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, ${\\cal U}^{\\cal P}_{M,\\sigma}[\\cdot]$, in place of Moggi's monadic $let_T$, thus simplifying the equational theory. The rules for ${\\cal U}^{\\cal P}_{M,\\sigma}[\\cdot]$ permit also the removal of the monad once the constraint is satisfied. We derive the meta-theory of $\\mathsf{LLF}_{\\cal P}$ by a novel indirect method based on the encoding of $\\mathsf{LLF}_{\\cal P}$ in $\\mathsf{LF}$. We discuss encodings in $\\mathsf{LLF}_{\\cal P}$ of call-by-value $\\lambda$-calculi, Hoare's Logic, and Fitch-Prawitz Naive Set Theory.<\/jats:p>\n                  <jats:p>Comment: Accepted for publication in LMCS<\/jats:p>","DOI":"10.23638\/lmcs-13(3:2)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:33:41Z","timestamp":1743687221000},"source":"Crossref","is-referenced-by-count":3,"title":["$\\mathsf{LLF}_{\\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads"],"prefix":"10.23638","volume":"Volume 13, Issue 3","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Liquori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0400-7467","authenticated-orcid":false,"given":"Petar","family":"Maksimovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Scagnetto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2017,7,6]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1702.07214v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1702.07214v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:33:41Z","timestamp":1743687221000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,6]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(3:2)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1702.07214","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1702.07214","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.307.3","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.307.5","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,6]]},"article-number":"3771"}}