Sciweavers

660 search results - page 7 / 132
» The Implicit Calculus of Constructions
Sort
View
LPAR
2010
Springer
13 years 6 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
13 years 11 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent