Plugging-in Proof Development Environments using Locks in LF - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2018

Plugging-in Proof Development Environments using Locks in LF

Abstract

We present two extensions of the LF Constructive Type Theory featuring monadic locks. A lock is a monadic type construct that captures the effect of an external call to an oracle. Such calls are the basic tool for plugging-in, i.e. gluing together, different Type Theories and proof development environments. The oracle can be invoked either to check that a constraint holds or to provide a suitable witness. The systems are presented in the canonical style developed by the "CMU School". The first system, CLLFP , is the canonical version of the system LLFP, presented earlier by the authors. The second system, CLLF P? , features the possibility of invoking the oracle to obtain also a witness satisfying a given constraint. We discuss encodings of Fitch-Prawitz Set theory, call-by-value λ-calculi, systems of Light Linear Logic, and partial functions.

Keywords

Fichier principal
Vignette du fichier
MSCS2016.pdf (551.47 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01272647 , version 1 (11-02-2016)

Identifiers

  • HAL Id : hal-01272647 , version 1

Cite

Furio Honsell, Luigi Liquori, Petar Maksimovic, Ivan Scagnetto. Plugging-in Proof Development Environments using Locks in LF. Mathematical Structures in Computer Science, 2018, 28 (9), pp.1578--1605. ⟨hal-01272647⟩
152 View
122 Download

Share

Gmail Mastodon Facebook X LinkedIn More