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.KeywordsData TypeTarget LanguageSemantic FunctionCorrectness ProofAbstract Data TypeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
