Program recursive forms and programming automatization for functional languages

Authors:
N. Archvadze;M. Pkhovelishvili;L. Shetsiruli;M. Nizharadze
Affiliations:
Department of Computer Sciences, Faculty of Exact and Natural Sciences, I. Javakhishvili Tbilisi State University, Tbilisi, Georgia;Department of Programming, N. Muskhelishvili computing mathematic Institute, Tbilisi, Georgia;Department of Mathematics and Computer Science, Shota Rustaveli State University, Batumi, Georgia;Faculty of Informatics and Control System, Georgian Technical University, Tbilisi, Georgia
Venue:
WSEAS Transactions on Computers
Year:
2009

Citing 4
Cited 0

A general student's model suitable for intelligent e-learning systems

ECC'08 Proceedings of the 2nd conference on European computing conference
E-TLSS: a powerful e-learning tool for structural synthesis of TL circuits

ECC'08 Proceedings of the 2nd conference on European computing conference
Use of artificial intelligence techniques to fault diagnosis in analog systems

ECC'08 Proceedings of the 2nd conference on European computing conference
A recursion forms and their verification by using the inductive methods

ECC'09 Proceedings of the 3rd international conference on European computing conference

Quantified Score

Hi-index	0.00

Visualization

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.