Data structured programming: Programm design without Arrays and Pointers
IEEE Transactions on Software Engineering
The Effect of Data Abstraction on Loop Programming Techniques
IEEE Transactions on Software Engineering
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Programming by multiset transformation
Communications of the ACM
Programming parallel algorithms
Communications of the ACM
An introduction to SequenceL: a language to experiment with constructs for processing nonscalars
Software—Practice & Experience
Communications of the ACM
Automatic parallel control structures in SequenceL
Software—Practice & Experience
Implicit parallel programming in pH
Implicit parallel programming in pH
Scrap your boilerplate: a practical design pattern for generic programming
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Scrap more boilerplate: reflection, zips, and generalised casts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
A programming language
Iterative and parallel algorithm design from high level language traces
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
SequenceL provides a different way to view programming
Computer Languages
SequenceL: transparency and multi-core parallelisms
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
Hi-index | 0.00 |
SequenceL is a concise, high-level language with a simple semantics that provides for the automatic derivation of many iterative and parallel control structures. The semantics repeatedly applies a “Normalize-Transpose-Distribute” operation to functions and operators until base cases are discovered. Base cases include the grounding of variables and the application of built-in operators to operands of appropriate types. This article introduces the results of a 24-month effort to reduce the language to a very small set of primitives. Included are comparisons with other languages, the formal syntax and semantics, and the traces of several example problems run with a prototype interpreter developed in 2006.