P. Krutchen, E. Schonberg, and J. Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66 75, October 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....powerful, than domain specific software generators. The goal of VHLL implementors is to find abstractions that are more natural and expressive than the one provided by high level languages like C, Lisp, Fortran. Examples of VHLLs are languages that implement set theoretical abstractions like SETL [Krutchen et al. 1984] and PAISLey [Zave and Schell, 1986] or declarative constraint based languages like MODEL [Prywes and Lock, 1989] Problems with this approach are poor run time performance and the difficulty associated to using high level mathematical abstractions. For more details about VHLL applications see ....

....is the use of program transfor mation systems that provide a library of refinements, or rules, on how to translate these high level constructs into more tractable expressions. Advice is then required to select the refinements to be applied. Some examples of very high level languages are SETL [Krutchen et al. 1984, Schonberg et al. 1986] Gist, Balzer, 1985] V [Smith et al. 1985] and Refine [Smith et al. 1985] SETL , a language based on the use of set and set operations, was one of the first very high level languages. The SETL compiler decides how the data structures, specified at a high level of ....

P. Krutchen, E. Schonberg, and J. Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66 75, October 1984.

....software patterns[Capers, 1984] for instance The Programmer s Apprentice[Rich, 1988] Transformation Systems[Cheatham, 1984;Freeman, 1987] Application Generators[Krueger,1992;Neighbors, 1989] for instance UNIX s YACC. Very high level languages[Krueger,1992] for instance SETL[Kruchten, 1984]. Technologies incorporating some aspects of the reuse concept such as Object Orientation, standard programming component libraries and platform independent operating systems seem to becoming common place[Biggerstaff, 1989] Surveys of benefits achieved from the introduction of reuse are ....

P. Kruchten, E. Schonberg and J. Schwartz, "Software Prototyping Using the SETL Programming Language," IEEE Software, vol. 1, no. 4, pp. 66-75, October 1984.

....Thus, high level languages can actually increase runtime performance. Two interesting variants of high level languages are so called very high level languages and domain specific languages. Very high level languages emphasize formality and elegance of expression [Kru92] examples include SETL [Kru84] and SML [Pau96] Domain specific languages [USE97] a.k.a. narrow spectrum languages [Nei89] are specialized to a particular family [Par79] a.k.a. class or product line) of related systems; they are typically implemented using either transformation systems (see Section 2.1.8) or generators ....

Philippe Kruchten, Ed Schonberg, and Jacob Schwartz. Software Prototyping using the SETL Programming Language. In IEEE Software, October 1984, pages 66-75.

....The procedural, set oriented language ProSet [5] is a successor to SETL [20] ProSet is an acronym for PROtotyping with SETs. The high level structures that ProSet provides qualify the language for prototyping. Refer to [4] for a full account of prototyping with set oriented languages and to [6, 18] for case studies for prototyping using SETL. 2.1 Basic Concepts ProSet provides the data types atom, integer, real, string, Boolean, tuple, set, function, and module. ProSet is weakly typed, i.e. the type of an object is in general not known at compile time. Atoms are unique with respect to ....

P. Kruchten, E. Schonberg, and J.T. Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66--75, October 1984.

....processes increases the search space. The parallel best first algorithm is not necessarily much faster than the sequential best first algorithm, but can produce better results within the same or even a shorter time. The f( function for the 6 0 10 20 30 40 50 60 70 80 90 0 5 10 15 20 25 Number of workers (a) T=6 T=5 T=4 T=3 T=2 0 2 4 6 8 10 12 14 16 0 5 10 15 20 25 Number of workers (b) T=6 T=5 T=4 T=3 T=2 Figure 5: The experimental results for the ProSet Linda implementation of the parallel best first search algorithm. estimated new ....

....the sequential best first algorithm, but can produce better results within the same or even a shorter time. The f( function for the 6 0 10 20 30 40 50 60 70 80 90 0 5 10 15 20 25 Number of workers (a) T=6 T=5 T=4 T=3 T=2 0 2 4 6 8 10 12 14 16 0 5 10 15 20 25 Number of workers (b) T=6 T=5 T=4 T=3 T=2 Figure 5: The experimental results for the ProSet Linda implementation of the parallel best first search algorithm. estimated new state evaluations directs the workers to search the tree depth first, which increases the probability of ....

[Article contains additional citation context not shown here]

P. Kruchten, E. Schonberg, and J.T. Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66--75, October 1984.

....language Linda (Gelernter, 1985; Carriero and Gelernter, 1992) to obtain a parallel programming language as a tool for prototyping parallel algorithms (Hasselbring, 1994b) ProSet is an acronym for PROTOTYPING WITH SETS. The procedural, set oriented language ProSet is a successor to SETL (Kruchten et al. 1984). The high level structures that ProSet provides qualify the language for prototyping. Refer to (Kruchten et al. 1984) for a case study using SETL for prototyping. 2.1 Basic Concepts ProSet provides the data types atom, integer, real, string, Boolean, tuple, set, function, and module. As a ....

....tool for prototyping parallel algorithms (Hasselbring, 1994b) ProSet is an acronym for PROTOTYPING WITH SETS. The procedural, set oriented language ProSet is a successor to SETL (Kruchten et al. 1984) The high level structures that ProSet provides qualify the language for prototyping. Refer to (Kruchten et al. 1984) for a case study using SETL for prototyping. 2.1 Basic Concepts ProSet provides the data types atom, integer, real, string, Boolean, tuple, set, function, and module. As a prototyping language, ProSet is weakly typed, i.e. the type of an object is in general not known at compile time. Atoms are ....

[Article contains additional citation context not shown here]

Kruchten, P., Schonberg, E., and Schwartz, J., Software prototyping using the SETL programming language, IEEE Software 1, 66--75 (1984).

....to data and control structures of the language and a short example. The high level structures that ProSet provides qualify the language for prototyping. For a full account to prototyping with set oriented languages we refer to [7] A case study for prototyping using SETL is documented in [22]. The application of SETL for prototyping algorithms for parallelizing compilers is described in [25] ProSet provides data types for atom, integer, real, string, Boolean, tuple, set, function, and module values. It is a higher order language, because functions and modules have first class ....

Kruchten P, Schonberg E, Schwartz J. Software prototyping using the SETL programming language. IEEE Software, pp 66--75, 1984.

.... Very highl level anguages e p [83] reusabl rocessor [77] etc Software c specifiations complete Emphac tically ompositional complete compositional depends e s on th ystem Simos ASL are application specific ] S languages [148] PAISLey [162 ETL [82] and others are based on l a application independent mathematica nd computational abstractions. # ##################################################################################################################### # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # ....

P. Kruchten, E. Schonberg, and J. Schwartz, "Software prototyping using the SETL programming language," IEEE 8 Software, vol. 1, no. 4, pp. 66-75, October 1984.

....In spite of its central place in mathematical discourse, set theory has had a relatively minor influence on programming language design. One conspicuous exception is SETL [28] a programming language that has demonstrated the benefits of finite set theory for software design and prototyping [20], program verification [6] and top down program (and algorithm) development methodology [7, 24, 25] At the same time, a decade long experience with SETL has underscored three shortcomings in its use [11] a) Standard compilation and optimization techniques fare poorly in a language with finite ....

Kruchten, K., Schonberg, E., and Schwartz, J., "Software Prototyping using the SETL Programming Language," IEEE Software, pp. 66-75, Oct., 1984.

....[4] is a successor to SETL [26] ProSet is an acronym for PROtotyping with SETs. The high level structures that ProSet provides qualify the language for prototyping. Refer to [3] for a full account of prototyping with setoriented languages. A case study for prototyping using SETL is documented in [20]. The use of SETL for prototyping algorithms for parallelizing compilers is described in [23] Section 2.1 introduces the basic concepts of ProSet and Section 2.2 gives a short description of the features for parallel programming. 2.1 Basic Concepts ProSet provides the data types atom, integer, ....

P. Kruchten, E. Schonberg, and J. Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66--75, October 1984.

....distributed data processing. Flexibility does not itself ensure good discipline, but is highly desirable for rapid prototyping. This fills an important need, because experimentation is a crucial early phase in the evolution of most large software systems, especially those featuring novel designs [135, 173, 66, 70, 71]. Second, SETL s strong bias in favor of value semantics facilitates the distribution of work and responsibility over multiple processes in the client server setting. The absence of pointers eliminates a major nuisance in distributed systems design, namely the question of how to copy data ....

....language. Recently, Toto Paxia has made improvements to the interoperability of SETL2 through his native package declarations [168] which allow more direct calls out to routines written in C than were previously possible. Perhaps the most famous of all SETL programs to date is Ada Ed [2, 135, 173], the first validated translator and executable semantic model for the language now known as Ada 83 [198] It established convincingly that SETL is well suited for the rapid prototyping of complex systems of significant size, and that when care is taken in the construction of such prototypes, they ....

Philippe Kruchten, Edmond Schonberg, and Jacob Schwartz. Software prototyping using the SETL programming language. IEEE Software, 1(4):66--75, October 1984.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC