143 search results - page 22 / 29 » Abstract Interpretation and Partial Evaluation in Functional... |
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
DIS
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
SIAMCOMP
2008
13 years 7 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...
LISP
2008
13 years 7 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
AISC
2004
Springer
13 years 11 months ago
2004
Springer
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...