1989 search results - page 246 / 398 » Set functions for functional logic programming |
130
click to vote
MP
1998
15 years 3 months ago
1998
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
108
click to vote
TAP
2010
Springer
15 years 1 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
128
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
119
click to vote
TCS
2002
15 years 3 months ago
2002
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider...
130
click to vote
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...