Skip to main content
Conference ProceedingsOPEN ACCESS

Provable correctness of prototype interpreters in LDL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 786 LNCS 217-232
DOI: 10.1007/3-540-57877-3_15
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

LDL is a system supporting the design of procedural programming languages and generating prototype interpreters directly from the language definition. A language definition is based on GSFs — a kind of attribute grammars — and the denotational semantics approach. It is shown how denotational semantics can be transformed into Prolog. It is also shown how the correctness of the prototype interpreters can be proved using a technique developed by Clark and extended by Deransart.

Cite

CITATION STYLE

APA

Lämmel, R., & Riedewald, G. (1994). Provable correctness of prototype interpreters in LDL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 786 LNCS, pp. 217–232). Springer Verlag. https://doi.org/10.1007/3-540-57877-3_15

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