Add to ORKGThe functional systems of the recursive functions with closure software are investigated. The aim is to solve the completeness problem, to describe the structure of the closed ones and to compare the different conceptions of the computability on base of the obtained results. The completeness problem for different classes of the program circuits has been solved. The new methods for description of the closed classes have been developed. The results were applied in the investigations of recursive function algebras (for example, in the Kazan State University) and abstract theory of computability.Available from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
AbstractFunctional languages are based on the notion of application: programs may be applied to data...
Problems related to the complexity and to the decidability of several languages weaker than Prolog ...
AbstractProblems related to the complexity and to the decidability of several languages weaker than ...
Functional systems, based on the program notion are considered in the paper aiming at the general me...
this paper are related to "program verification" very much like predicate logic and its co...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
Abstract:- The automatic programming system has been considered by means of which it becomes easier ...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of t...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
We study the family of stable models of finite and recursive predicate logic programs. We show that ...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
AbstractFunctional languages are based on the notion of application: programs may be applied to data...
Problems related to the complexity and to the decidability of several languages weaker than Prolog ...
AbstractProblems related to the complexity and to the decidability of several languages weaker than ...
Functional systems, based on the program notion are considered in the paper aiming at the general me...
this paper are related to "program verification" very much like predicate logic and its co...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
The symbolic computations of recursive programmes were investigated with the aim of study of complex...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
Abstract:- The automatic programming system has been considered by means of which it becomes easier ...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of t...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
We study the family of stable models of finite and recursive predicate logic programs. We show that ...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
AbstractFunctional languages are based on the notion of application: programs may be applied to data...
Problems related to the complexity and to the decidability of several languages weaker than Prolog ...
AbstractProblems related to the complexity and to the decidability of several languages weaker than ...