๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Specification languages in algebraic compilers

โœ Scribed by Eric Van Wyk


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
353 KB
Volume
291
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis


Algebraic compilers provide a powerful and convenient mechanism for specifying language translators. With each source language operation one associates a computation for constructing its target language image; these associated computations, called derived operations, are expressed in terms of operations from the target language. Sometimes the target language is not powerful enough to specify the required translation and one may then need to extend the target language algebras with more computationally expressive operations or elements. A better solution is to package these extensions in a speciรฟcation language which can be composed with the target language to ensure that all operations and elements needed or desired for performing the translation are provided. In the example in this paper, we show how imperative and functional speciรฟcation languages can be composed with a target language to implement a temporal logic model checker as an algebraic compiler and show how speciรฟcation languages can be seen as components to be combined with a source and target language to generate an algebraic compiler.


๐Ÿ“œ SIMILAR VOLUMES


On algebraic and logical specifications
โœ Bakhadyr Khoussainov ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speciรฟcations of these classes from algebraic, computational and logical points of view.

Chebyshev and Legendre Spectral Methods
โœ John P. Boyd ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 710 KB

In this tutorial, we show how to combine Galerkin and collocation methods with algebraic manipulation languages. Because polynomial and trigonometric manipulations are a special strength of REDUCE, Maple, and other symbolic languages, it is easy to use Chebyshev and Legendre polynomials and Fourier