3713 search results - page 25 / 743 » Constructing a Calculus of Programs |
CSL
2005
Springer
14 years 28 days ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
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...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
TPHOL
2005
IEEE
14 years 29 days ago
2005
IEEE
