no. R1
Post grammars as a programming language description tool
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 9 (1975) no. R1, pp. 43-72 
@article{ITA_1975__9_1_43_0,
     author = {Feautrier, Paul},
     title = {Post grammars as a programming language description tool},
     journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique},
     pages = {43--72},
     year = {1975},
     publisher = {Dunod-Gauthier-Villars},
     address = {Paris},
     volume = {9},
     number = {R1},
     mrnumber = {478770},
     zbl = {0328.68005},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1975__9_1_43_0/}
}
TY  - JOUR
AU  - Feautrier, Paul
TI  - Post grammars as a programming language description tool
JO  - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
PY  - 1975
SP  - 43
EP  - 72
VL  - 9
IS  - R1
PB  - Dunod-Gauthier-Villars
PP  - Paris
UR  - https://www.numdam.org/item/ITA_1975__9_1_43_0/
LA  - en
ID  - ITA_1975__9_1_43_0
ER  - 
%0 Journal Article
%A Feautrier, Paul
%T Post grammars as a programming language description tool
%J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
%D 1975
%P 43-72
%V 9
%N R1
%I Dunod-Gauthier-Villars
%C Paris
%U https://www.numdam.org/item/ITA_1975__9_1_43_0/
%G en
%F ITA_1975__9_1_43_0
Feautrier, Paul. Post grammars as a programming language description tool. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 9 (1975) no. R1, pp. 43-72. https://www.numdam.org/item/ITA_1975__9_1_43_0/

[1] R. M. Burstall, Some techniques for proving correctness of programs which alter data structures, Machine Intelligence, 7 (1972), 23-50. | Zbl

[2] H. B. Curry, Foundations of Mathematical Logic, Mac Graw Hill, New York, 1963. | Zbl

[3] H. B. Curry and R. Feys, Combinatory Logic, vol. I. North Holland, Amsterdam, 1958. | Zbl

[4] P. Feautrier, Introduction aux langages de Post en tant qu'outil de formalisation. Publication de l'Institut de Programmation de l'Université Paris VI, n° 74-7, Paris, 1974.

[4] R. Floyd, Assigning Meanings to Programs, Proc. Amer. Math Soc. Symposia on Applied Math, 19 (1966), 19-32. | Zbl

[6] C. A. R. Hoare, An Axiomatic Basis for Computer Programming, Comm. Assoc. Comp. Mach, 12 (1969), 576-583. | Zbl

[7] C. A. R. Hoare and N. Wirth, An Axiomatic Definition of the Programming language Pascal, Acta Informatica, 2 (1973), 335-355. | Zbl

[8] D. E. Knuth, Semantics of context free languages, Math. Syst. Th., 2 (1968), 127-145. | Zbl

[9] H. F. Ledgard, Production Systems : or can we do better than BNF, Comm. Assoc. Comp. Mach, 17 (1974), 94-102. | Zbl

[10] P. Lucas and K. Walk, On the formal Description of PL/I, Ann. Rev. on Automatic Programming, 6 (1969), 105-182. | Zbl

[11] R. Milner, Implementation and Applications of Scott's LCF. Proc. Conf. on Proving Assertions about Programs, New Mexico State U, 1972, 1-6.

[12] L. Nolin, Formalisation des notions de machine et de programme, Paris, Gauthier Villard, 1968. | Zbl

[13] E. Post, Formal Reduction of the general combinatorial decision problem, Amer. J. Math, 65 (1943), 197-215. | Zbl

[14] P. C. Rosenbloom, The Elements of Mathematical Logic, Dover, New York, 1950. | Zbl

[15] R. J. Waldinger, and R. C. T. Lee, PROW, a step toward automatic programwriting, Proc. Int. J. Conf. on Artificial Intelligence, N. Y., 1969, 241-252.