46 search results - page 6 / 10 » Synthesizing Proofs from Programs in the Calculus of Inducti... |
126
Voted
ICFP
1997
ACM
15 years 1 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
KBSE
1999
IEEE
15 years 1 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
107
click to vote
ICFP
2012
ACM
12 years 12 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
TYPES
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
VMCAI
2004
Springer
15 years 2 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...