ON ONE COMPLETE AND MINIMAL SET OF BUILT-IN CONSTANTS FOR BACKUS FP SYSTEM

Authors

  • G.A. Martirosyan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2012.46.3.044

Keywords:

Backus FP system, functional programming language, built-in constants, Turing completeness, minimality

Abstract

In the present paper the completeness and the minimality of the set of the following built-in constants of Backus FP system are proved: Identity, Head, Tail, Append left, Equals, Composition, Constuction, Condition, Constant. 

Downloads

Published

2012-12-01

How to Cite

Martirosyan, G. (2012). ON ONE COMPLETE AND MINIMAL SET OF BUILT-IN CONSTANTS FOR BACKUS FP SYSTEM. Proceedings of the YSU A: Physical and Mathematical Sciences, 46(3 (229), 44–51. https://doi.org/10.46991/PYSU:A/2012.46.3.044

Issue

Vol. 46 No. 3 (229) (2012)

Section

Informatics

License

Copyright (c) 2012 Proceedings of the YSU

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Crossref
Scopus
Google Scholar
Europe PMC