8766 search results - page 456 / 1754 » Functional logic programming |
140
click to vote
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
139
click to vote
CADE
2004
Springer
15 years 9 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
152
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
132
click to vote
FROCOS
2005
Springer
15 years 9 months ago
2005
Springer
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
136
click to vote
COR
2008
15 years 4 months ago
2008
Evolutionary Testing is a promising approach for automating the testing of software-based systems. A number of papers have been published in the last years which have successfully...