3552 search results - page 596 / 711 » Proof theory in the abstract |
157
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
305
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
258
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
154
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
178
click to vote
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...