34 search results - page 6 / 7 » Partial Recursive Functions in Higher-Order Logic |
AIML
2006
13 years 7 months ago
2006
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
IWFM
1998
13 years 7 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
ICFP
2006
ACM
14 years 6 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
SIAMCOMP
2008
13 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...