Executable specification of static semantics
Thierry Despeyroux · Lecture notes in computer science · 1984
Cited by 66 works. doi:10.1007/3-540-13346-1_11
Authors
References
- A Machine-Oriented Logic Based on the Resolution Principle
- A theory of type polymorphism in programming
- Semantics of context-free languages
- Principal type-schemes for functional programs
- Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 (1979), pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 403–415. - Dexter Kozen and Rohit Parikh. An elementary proof of the completeness of PDL. Theoretical computer science, vol. 14(1981), pp. 113–118.
- Edinburgh LCF
- Semantical consideration on floyo-hoare logic
- Programming Environments Based on Structured Editors: The MENTOR Experience,
- Generating Language-Based Environments
- A semantic model of types for applicative languages