Simple typed functional programming languages
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2007), pp. 223-234
Cet article a éte moissonné depuis la source Math-Net.Ru
The paper presents a way of constructing simple functional programming languages that fit to define classes of recursive functions with bounded computational complexity. All processed data in the language are restricted with types, that also can be constructed in the language. The languages can be used both to concern complexity algorithms classes and to be expanded for practical programming use.
@article{VUU_2007_1_a15,
author = {A. P. Beltiukov},
title = {Simple typed functional programming languages},
journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
pages = {223--234},
year = {2007},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VUU_2007_1_a15/}
}
A. P. Beltiukov. Simple typed functional programming languages. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2007), pp. 223-234. http://geodesic.mathdoc.fr/item/VUU_2007_1_a15/