Site logo

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

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

CC BY-NC 4.0 This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Subscribe to TheGufo Newsletter​