3481 search results - page 549 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
243
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
130
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
136
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
124
click to vote
CADE
2004
Springer
16 years 3 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
129
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...