797 search results - page 5 / 160 » Eliminating Proofs from Programs |
GPCE
2005
Springer
2005
Springer
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
15 years 3 months ago
104
click to vote
CADE
2005
Springer
15 years 9 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
96
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
104
Voted
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...