331 search results - page 19 / 67 » HOLCF: Higher Order Logic of Computable Functions |
123
click to vote
TAP
2010
Springer
14 years 10 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
121
Voted
ENTCS
2007
15 years 10 days ago
2007
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
110
click to vote
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
DSD
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...