Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
The C programming language
Naive evaluation of recursively defined relations
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
SETL to ADA—tree transformations applied
Information and Software Technology
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program derivation by fixed point computation
Science of Computer Programming
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Automatic Technique for Selection of Data Representations in SETL Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with the SETL Optimizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic data structure choice in a language of very high level
Communications of the ACM
Language Polynomial in the Input Plus Output
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
A Language for Semantic Analysis
A Language for Semantic Analysis
Measuring setl performance
Taliere: an interactive system for data structuring setl programs
Taliere: an interactive system for data structuring setl programs
A programming language
Future directions in program transformations
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
High level reading and data structure compilation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated development of software for program analysis and transformation
ACM SIGSOFT Software Engineering Notes
Higher-Order and Symbolic Computation
Universal Regular Path Queries
Higher-Order and Symbolic Computation
Program Synthesis from Formal Requirements Specifications Using APTS
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
The TXL source transformation language
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
| Hi-index | 0.00 |
This paper reports experimental results that support the feasibility of a new transformational approach developed by the authors for implementing complex algorithms correctly and efficiently. The class of algorithms amenable to our methods includes nonnumerical graph algorithms. Experiments were performed to measure how this approach affects productivity (in terms of the number of source lines in the implementation divided by manual programming time) and running times. Comparative benchmarks showed that productivity can be increased over a conventional ad hoc approach by factors ranging from 5.1 to 9.9 Preliminary results also showed that the running time of C code produced by this new approach can be as fast as 1.5 times that of tightly coded high quality Fortran.