Abstract- SequenceL is a concise, high-level language with a simple semantic that provides for the automatic derivation of many iterative and parallel control structures. The semantic repeatedly applies a “Normalize-Transpose ” operation to functions and operators until base cases are discovered, which include the grounding of variables and the application of built-in operators to operands of appropriate types. This paper introduces the language from an intuitive point of view, indicating the scalability of the normalize-transpose, the different forms of recursion supported by the language and its abstraction, and new shorthand methods for specifying additional iterative/recursive problem solutions.

hereby granted, provided that this notice and the reference

SequenceL is a concise, high-level language with a simple semantic that provides for the automatic derivation of many iterative and parallel control structures. The semantic 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 paper 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.

This paper presents a programming language which we believe to be most appropriate for the automation of parallel data processing, especially data processing of concern to the oil industry and to the U.S. Federal Agencies involved in the analysis of Satellite Telemetry Data. Focus is placed upon major language issues facing the development of the information power grid. The paper presents an example of the type of parallelism desired in the Grid. To implement this parallelism in such a language as Java we need to specify parallelism explicitly. We show that if we rewrite the same solution in the high level language SequenceL, then parallelism becomes implicit. SequenceL seems therefore to be a good candidate for a Grid Oriented Language, because its abstraction relieves the problem solver of much of the burden normally required in development of parallel problem solutions. Key words: Automatic concurrency, SequenceL, term-rewriting systems 1 The Need for New Language Abstractions Ha...

Introduction. The beginning of modern computer science can be marked by Alan Turings paper, which among other advances, showed that there are unsolvable problems. [1] Within the infinite set of solvable problems there is a set of technically feasible and problems that are not technically feasible to solve (e.g., problems that it would take a supercomputer of today 10,000 years to solve). Thus, from the beginning, computer science has been viewed as the science of problem solving using computers. One category of computer science research is devoted to outwardly encroaching upon the set of infeasible problems. Advances in computer hardware, for example, lead to more powerful computers that execute faster and have larger stores of memory. Advances in hardware are meant to result in improvements in the raw computing power of the devices that can be brought to bear in order to solve more complex problems. Additionally, research efforts focusing on complexity and alg

This paper demonstrates how appropriate language design can place high level languages in the hands of scientists and engineers, thus providing a more automated approach to problem solving that may reduce the amount of computer scientist involvement. The language SequenceL serves as an example of this approach