JUCS - Journal of Universal Computer Science 19(6): 729-749, doi: 10.3217/jucs-019-06-0729
Investigations on a Pedagogical Calculus of Constructions
expand article infoLoïc Colson, Vincent Demange
‡ LITA, University of Lorraine, Metz, France
Open Access
In the last few years appeared pedagogical propositional natural deduction systems. In these systems one must satisfy the pedagogical constraint: the user must give an example of any introduced notion. In formal terms, for instance in the propositional case, the main modification is that we replace the usual rule (hyp) by the rule (p-hyp) where σ denotes a substitution which replaces variables of Γ with an example. This substitution σ is called the motivation of Γ. First we expose the reasons of such a constraint and properties of these "pedagogical" calculi: the absence of negation at logical side, and the "usefulness" feature of terms at computational side (through the Curry-Howard correspondence). Then we construct a simple pedagogical restriction of the calculus of constructions (CC) called CCr. We establish logical limitations of this system, and compare its computational expressiveness to Gödel system T. Finally, guided by the logical limitations of CCr, we give a formal and general definition of a pedagogical calculus of constructions.
mathematical logic, negationless mathematics, constructive mathematics, typed lambda-calculus, calculus of constructions, pedagogical system