Abstract:- The automatic programming system has been considered by means of which it becomes easier to carry out traditional programming stages. There is discussed both recursive forms: parallel, interrecursion and recursion of high level that exist for functional programming languages and induction methods for the purpose of their verification. The way how to present imperative languages easy and double cycles by means of recursion forms is shown, the possibility of verification has been studied for each recursion form
User defined recursive types are a fundamental feature of modern functional programming languages li...
AbstractIterative forms are derived for a class of recursive functions, i.e. the recursion is “remov...
This thesis deals with the use of constructive type theory as a programming language. In particular,...
Functional programming languages are shown to be useful in the teaching of the concepts of recursion...
AbstractThe paper presents a system, ADATE, for automatic functional programming. ADATE uses specifi...
The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations t...
There are various issues in the Olympiads in Computer Science. In particular, one of them is a recur...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
this paper are related to "program verification" very much like predicate logic and its co...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
The functional systems of the recursive functions with closure software are investigated. The aim is...
User defined recursive types are a fundamental feature of modern functional programming languages li...
User defined recursive types are a fundamental feature of modern functional programming languages li...
AbstractIterative forms are derived for a class of recursive functions, i.e. the recursion is “remov...
This thesis deals with the use of constructive type theory as a programming language. In particular,...
Functional programming languages are shown to be useful in the teaching of the concepts of recursion...
AbstractThe paper presents a system, ADATE, for automatic functional programming. ADATE uses specifi...
The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations t...
There are various issues in the Olympiads in Computer Science. In particular, one of them is a recur...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
AbstractFinitely typed functional programs are naturally classified by their levels. This syntactic ...
this paper are related to "program verification" very much like predicate logic and its co...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
The functional systems of the recursive functions with closure software are investigated. The aim is...
User defined recursive types are a fundamental feature of modern functional programming languages li...
User defined recursive types are a fundamental feature of modern functional programming languages li...
AbstractIterative forms are derived for a class of recursive functions, i.e. the recursion is “remov...
This thesis deals with the use of constructive type theory as a programming language. In particular,...