Calculating Software Generators from Solution Specifications
Richard B. Kieburtz,Françoise Bellegarde,Jef Bell,James Hook,Jeffrey R. Lewis,Dino Oliva,Tim Sheard,Lisa Walton,Tong Zhou +8 more
- pp 546-560
TLDR
An automated transformation system is demonstrated that compiles practical software modules from the semantic specification of a domain-specific application design language and demonstrates the feasibility of this approach.Abstract:
We have successfully demonstrated an automated transformation system that compiles practical software modules from the semantic specification of a domain-specific application design language. The integrated suite of transformation and translation tools represents a new level of design automation for software. Although there is much more that can be done to further improve the performance of generated code, the prototype system demonstrates the feasibility of this approach.read more
Citations
More filters
Proceedings ArticleDOI
Multi-stage programming with explicit annotations
Walid Taha,Tim Sheard +1 more
TL;DR: A thesis of this paper is that multi-stage languages are useful as programming languages in their own right, and should support features that make it possible for programmers to write staged computations without significantly changing their normal programming style.
Journal ArticleDOI
MetaML and Multi-Stage Programming with Explicit Annotations
Walid Taha,Tim Sheard +1 more
TL;DR: It is argued that multi-stage languages are useful as programming languages in their own right, that they supply a sound basis for high-level program generation technology, and that they should support features that make it possible for programmers to write staged computations without significantly changing their normal programming style.
Journal ArticleDOI
From ML to Ada: Strongly-typed language interoperability via source translation
Andrew Tolmach,Dino Oliva +1 more
TL;DR: A system that supports source-level integration of ML-like functional language code with ANSI C or Ada83 code, and offers simple, efficient, type-safe inter-operation between new functional code components and ‘legacy’ third-generation-language components.
Journal ArticleDOI
On the recursive programming techniques
O. C. Juelich,James A. Ayers +1 more
TL;DR: One of the books you can enjoy now is recursive programming techniques here and it is your own time to continue reading habit.
Proceedings ArticleDOI
Abstract syntax from concrete syntax
TL;DR: Syntax from Concrete Syntax as discussed by the authors ] is a syntax from concrete syntax (SCTS) based approach for syntactically annotated concrete syntactic expressions. But
References
More filters
Book
The Definition of Standard ML
TL;DR: This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers, and the authors have defined their semantic objects in mathematical notation that is completely independent of StandardML.
Journal ArticleDOI
Deforestation: transforming programs to eliminate trees
TL;DR: The algorithm applies to any term containing only functions with definitions in a given syntactic form, and is suitable for incorporation in an optimizing compiler.
Proceedings ArticleDOI
Definitional interpreters for higher-order programming languages
TL;DR: The definition of a simple applicative programming language by means of an interpreter written in a similar language is considered, and the treatment of imperative features such as jumps and assignment is discussed.
Book ChapterDOI
An introduction to the theory of lists
TL;DR: In these lectures a notation and a calculus for specifying and manipulating computable functions over lists are introduced, used to derive efficient solutions for a number of problems, including problems in text processing.
Journal Article
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, Proc. Conference on Functional Programming Languages and Computer Architecture
TL;DR: In this article, a calculus for lazy functional programming based on recursion operators associated with data type definitions is developed, and various algebraic laws that are useful in deriving and manipulating programs are derived.