55 search results - page 8 / 11 » Generic proofs for combinator-based generic programs |
113
click to vote
POPL
2012
ACM
13 years 7 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
MICS
2010
14 years 10 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
CPP
2011
13 years 11 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
192
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
ICFP
2004
ACM
15 years 11 months ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...