Abstract
A programming environment for the Setl language is under development, using the Mentor system. Setl is a very high language, with a very flexible syntax and static semantics. The internal representation of a Setl program is a tree defined by the abstract syntax of Setl and annotated by computed type information. First, we discuss the choices done in the definition of the abstract syntax. Then we present the problems related to the type determination in Setl. They are solved by an abstract interpretation using unification and inference rules. This analysis is specified in the so called "natural semantics" and is implemented in Typol.
This work is supported by the SED Esprit project.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Clément, J. Despeyroux, T. Despeyroux, G. Kahn, "A simple applicative language: mini-ML", RR no 529, INRIA, may 86.
D. Clément, J. Despeyroux, T. Despeyroux, L. Hascoet, G. Kahn, "Natural semantics on the computer", RR no 416, INRIA, june 85.
P. Cousot, R. Cousot, "Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints", Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, January 1977.
R.B.K. Dewar, E. Dubinsky, E. Schonberg, J.T. Schwartz "Higher level programming: introduction to the use of the set theoretic programming language SETL", Courant Institute of Math Sciences, New York University, September 1984
V. Donzeau-Gouge, G. Kahn, B. Lang, B. Mélèse, "Outline of a tool for document manipulation", IFIP, September 1983.
G. Kahn, B. Lang, B. Mélèse, "Métal: a formalism to specify formalisms", Science of Computer Programming, North Holland, volume 3, no 2, August 1983, 151–188
P. Kruchten, E. Schonberg, J.T. Schwartz, "Software prototyping using the SETL programming language", IEEE Software, volume 1, no 4, 1984, 66–75
A. Mycroft, N.D. Jones, "A relational framework for abstract interpretations", Workshop "Programs as Data Objects", Copenhague, october 1985 (in Lecture Notes in Computer Science no 217)
R. Paige, "Transformational Programming — Applications to algorithms and systems", Proceedings Tenth ACM Symposium on Principles of Programming Languages, January 1983, 73–87
J.P. Rosen, "SETL: un language de très haut niveau pour le prototypage", Actes des journées AFCET "Nouveaux languages pour le Génie Logiciel", BIGRE + GLOBULE, no 45, Octobre 1985
E. Schonberg, J.T. Schwartz, M. Sharir, "An automatic technique for selection of data representations in Setl programs", ACM TOPLAS, volume 3, no 2, 126–143
A.M. Tenenbaum, "Type determination in a very high level language", Report NSO-3, Courant Institute of Math. Sciences, New York University, 1974
G. Weiss, "Recursive types in Setl: automatic determination and efficient implementation", PhD thesis, Courant Institute of Math. Sciences, New York University, October 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Donzeau-Gouge, V., Dubois, C., Facon, P., Jean, F. (1987). Development of a programming environment for Setl. In: Nichols, H., Simpson, D. (eds) ESEC '87. ESEC 1987. Lecture Notes in Computer Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022095
Download citation
DOI: https://doi.org/10.1007/BFb0022095
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18712-7
Online ISBN: 978-3-540-48117-1
eBook Packages: Springer Book Archive