46 search results - page 8 / 10 » Synthesizing Proofs from Programs in the Calculus of Inducti... |
POPL
2010
ACM
14 years 9 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
116
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
93
Voted
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...