Post grammars as a programming language description tool

Paul Feautrier

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1975)

  • Volume: 9, Issue: R1, page 43-72
  • ISSN: 0988-3754

How to cite

top

Feautrier, Paul. "Post grammars as a programming language description tool." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 9.R1 (1975): 43-72. <http://eudml.org/doc/92015>.

@article{Feautrier1975,
author = {Feautrier, Paul},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {R1},
pages = {43-72},
publisher = {EDP-Sciences},
title = {Post grammars as a programming language description tool},
url = {http://eudml.org/doc/92015},
volume = {9},
year = {1975},
}

TY - JOUR
AU - Feautrier, Paul
TI - Post grammars as a programming language description tool
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1975
PB - EDP-Sciences
VL - 9
IS - R1
SP - 43
EP - 72
LA - eng
UR - http://eudml.org/doc/92015
ER -

References

top
  1. [1] R. M. BURSTALL, Some techniques for proving correctness of programs which alter data structures, Machine Intelligence, 7 (1972), 23-50. Zbl0259.68009
  2. [2] H. B. CURRY, Foundations of Mathematical Logic, Mac Graw Hill, New York, 1963. Zbl0163.24209
  3. [3] H. B. CURRY and R. FEYS, Combinatory Logic, vol. I. North Holland, Amsterdam, 1958. Zbl0081.24104
  4. [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. 
  5. [4] R. FLOYD, Assigning Meanings to Programs, Proc. Amer. Math Soc. Symposia on Applied Math, 19 (1966), 19-32. Zbl0189.50204
  6. [6] C. A. R. HOARE, An Axiomatic Basis for Computer Programming, Comm. Assoc. Comp. Mach, 12 (1969), 576-583. Zbl0179.23105
  7. [7] C. A. R. HOARE and N. WIRTH, An Axiomatic Definition of the Programming language Pascal, Acta Informatica, 2 (1973), 335-355. Zbl0261.68040
  8. [8] D. E. KNUTH, Semantics of context free languages, Math. Syst. Th., 2 (1968), 127-145. Zbl0169.01401
  9. [9] H. F. LEDGARD, Production Systems : or can we do better than BNF, Comm. Assoc. Comp. Mach, 17 (1974), 94-102. Zbl0273.68018
  10. [10] P. LUCAS and K. WALK, On the formal Description of PL/I, Ann. Rev. on Automatic Programming, 6 (1969), 105-182. Zbl0217.53502
  11. [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. [12] L. NOLIN, Formalisation des notions de machine et de programme, Paris, Gauthier Villard, 1968. Zbl0309.68004
  13. [13] E. POST, Formal Reduction of the general combinatorial decision problem, Amer. J. Math, 65 (1943), 197-215. Zbl0063.06327
  14. [14] P. C. ROSENBLOOM, The Elements of Mathematical Logic, Dover, New York, 1950. Zbl0041.14804
  15. [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. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.