Implicit and noncomputational arguments using monads

Pierre Letouzey (1) , Bas Spitters (2)

1 LMU - Mathematisches Institut [München]
2 ICIS - Institute for Computing and Information Sciences [Nijmegen]

We provide a monadic view on implicit and noncomputational arguments. This allows us to treat Berger's non-computational quantifiers in the Coq-system. We use Tait's normalization proof and the concatenation of vectors as case studies for the extraction of programs. With little effort one can eliminate noncomputational arguments from extracted programs. One thus obtains extracted code that is not only closer to the intended one, but also decreases both the running time and the memory usage dramatically. We also study the connection between Harrop formulas, lax modal logic and the Coq type theory.

Mots clés: Program extraction; implicit arguments; monads; lax modal logic; Coq type theory

Domaines: Logique en informatique [cs.LO]

Pierre Letouzey, Bas Spitters. Implicit and noncomputational arguments using monads. 2005. ⟨hal-00150900⟩