Skip to main content
Conference ProceedingsOPEN ACCESS

Specification of compilers as abstract data type representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1980) 94 LNCS 140-164
DOI: 10.1007/3-540-10250-7_21
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a method for specifying and proving compilers. This method is based on the algebraic data types ideas. The main points are :to each language is associated an algebraic abstract data type.the semantic value of a program is given as a term of this data type.the translation of the semantic values of source programs into semantic values of target programs is specified and proved as the representation of an algebraic data type by another one. A compiler generator, PERLUETTE, which accepts such specifications as input is described. The proof technic is discussed.

Cite

CITATION STYLE

APA

Gaudel, M. C. (1980). Specification of compilers as abstract data type representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 94 LNCS, pp. 140–164). Springer Verlag. https://doi.org/10.1007/3-540-10250-7_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free