Investigated is algorithmic learning, in the limit, of correct programs for recursive functions f from both input/output examples of.f and several interesting varieties of approximate additional (algorithmic) informat...
详细信息
During the execution of functional logic programs, E-unification problems have to be solved quite frequently, where the underlying equational theory is induced by recursive functions. But, what about the decidability ...
详细信息
A formal language - the EP database is defined in this article. We prove that it is semantically equivalent to a class of total recursive functions. The conclusion serves as the theoretical foundation of Froglingo tha...
详细信息
ISBN:
(纸本)9781617820717
A formal language - the EP database is defined in this article. We prove that it is semantically equivalent to a class of total recursive functions. The conclusion serves as the theoretical foundation of Froglingo that consolidates the multi-component system architecture of the traditional software technologies into a single component. It also suggests how one might assess easy-of-use more objectively.
One usually defines the notion of a computable real number by using recursive functions. However, there is a simple way due to A. Mostowski to characterize the computable real numbers by using only primitive recursive...
详细信息
A new simplified proof of the McCreight-Meyer Honesty or Naming Theorem is given. Let t be a recursive function, and let F(t) be the set of recursive function computable within time bound t. Then it is shown that an h...
详细信息
Whilst widely recognised as an excellent means for solving problems and for designing software, functional programming languages have suffered from their inefficient implementations on conventional computers. A route ...
详细信息
We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the intended function as an inductive relation. Then ...
详细信息
This paper advocates and explores the use of multi-predicate induction schemes for proofs about mutually recursive functions. The interactive application of multi-predicate schemes stemming from datatype definitions i...
详细信息
Algorithms defined as recursive functions, such as in "pure" LISP, are shown to have structure sufficient to dis- tinguish between processes which must be executed in sequence and processes which may be exec...
详细信息
Algorithms defined as recursive functions, such as in "pure" LISP, are shown to have structure sufficient to dis- tinguish between processes which must be executed in sequence and processes which may be executed in parallel. An interpreter program is presented for executing LISP programs and simultaneously computing the number of processors needed at each step of program execution in order to achieve optimum parallel processing. Sample program runs are presented to show speed-up ratios between strictly sequential and optimally parallel executions. A possible hardware organization for a parallel processing system derived from the interpreter program is presented.
暂无评论