A semantic prototyping system
- 1 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 19 (6) , 213-221
- https://doi.org/10.1145/502949.502895
Abstract
We have written a set of computer programs for testing and exercising programming language specifications given in the style of denotational semantics. The system is built largely in Scheme 84, a dialect of LISP that serves as an efficient lambda-calculus interpreter. The system consists of:• a syntax-directed transducer, which embodies the principle of compositionality,• a type checker, which is extremely useful in debugging semantic definitions, and• an interface to the yacc parser-generator, which allows the system to use concrete syntax rather than the often cumbersome abstract syntax for its programs.In this paper, we discuss the design of the system, its implementation, and discuss its use.Keywords
This publication has 15 references indexed in Scilit:
- Compiling a functional languagePublished by Association for Computing Machinery (ACM) ,1984
- Testing the INRIA Ada formal definitionPublished by Association for Computing Machinery (ACM) ,1982
- A semantics-directed compiler generatorPublished by Association for Computing Machinery (ACM) ,1982
- Experience with an experimental compiler generator based on denotational semanticsPublished by Association for Computing Machinery (ACM) ,1982
- HOPEPublished by Association for Computing Machinery (ACM) ,1980
- Compiler generation from denotational semanticsPublished by Springer Nature ,1980
- A Metalanguage for interactive proof in LCFPublished by Association for Computing Machinery (ACM) ,1978
- Early experience with MesaCommunications of the ACM, 1977
- A Sampler of Formal DefinitionsACM Computing Surveys, 1976
- Compiler generation using denotational semanticsLecture Notes in Computer Science, 1976