Skip to Main content Skip to Navigation

Vers un calcul des constructions pédagogique

Abstract : Pedagogical formal systems have appeared recently for propositional calculus (up to the higher order), and it consists of systematically give examples of introduced notions (hypotheses). Formally, it means that to use a set Delta of formulas as hypotheses, one must first give a substitution sigma such that all the instances of formulas sigma(Delta) can be proved. This neccesity of giving examples has been pointed out by Poincaré (1913) as a common-sense practice: a definition of an object by means of assumptions has interest only if such an object can be constructed. This restriction applied to intuitionistic formal systems is consistent with the idea of negationless mathematics advocated by Griss (1946) in the middle of the past century, and shown as a more deep view of intuitionism. Through the Curry-Howard isomorphism (1980), the computational counterpart is the utility of programs defined in the associated functional systems: every function can be applied to a closed value. First results concerning propositional calculi up to the second-order has recently been published by Colson and Michel (2007, 2008, 2009). In this thesis we present an attempt to standardize and to extend to the Calculus of Constructions (CC) those previous results. First a formal and precise definition of pedagogical sub-systems of the Calculus of Constructions is introduced, and different such sub-systems are exhibited as examples.
Complete list of metadata
Contributor : Vincent Demange <>
Submitted on : Monday, June 24, 2013 - 6:17:11 PM
Last modification on : Wednesday, October 4, 2017 - 2:12:42 PM
Long-term archiving on: : Wednesday, September 25, 2013 - 4:11:48 AM


  • HAL Id : tel-00838147, version 1



Vincent Demange. Vers un calcul des constructions pédagogique. Logique en informatique [cs.LO]. Université de Metz; Université de Lorraine, 2012. Français. ⟨tel-00838147⟩



Record views


Files downloads