SCHWARTZ, J., AND DEWAR, R. 1986. Programming with Sets---An Introduction to SETL. SpringerVerlag, New York.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....49 B Matrix for Term Propagation 52 C Auxiliary Proofs for Termination of general aci 54 D Matching of Bound Set Terms 57 1 Introduction The problem of providing algorithms for the manipulation of set structures has received increasing attention in recent years. Various declarative languages [16, 18, 33, 25, 52, 13, 11, 43] rely on sets, or structures with similar properties, as rst class objects. Similarly, various proposals dealing with computability properties and algorithmic manipulation of set structures have recently appeared in research areas such as automated deduction [48] and database systems [37] ....

Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., and Schonberg, E. Programming with Sets: an Introduction to SETL, Springer Verlag, 1986.

....of the worst case time and space complexities is based on a thorough understanding of the compilation process, re ecting the complexities of the implementation back to the high level rules. Notation. We use a set based language for the formal derivation and analysis. The language is based on SETL [33, 34] extended with a xed point operation [8] we allow sets of heterogeneous elements and extend the language with pattern matching. Primitive data types are sets, tuples, and maps, i.e. binary relations represented as sets of 2 tuples. Their syntax and operations on them are summarized below: fX 1 ....

....complexity analysis. A recent follow up [26] discusses how to automate the complexity analysis but does not address the other limitations. Our derivation of complete algorithms and data structures from xed point speci cations uses Paige s method [27, 30, 28, 8, 29, 7] for languages like SETL [33, 34], except that based representations [29, 7] in his method do not apply and a more general and sophisticated combination of arrays, linked lists, and records is needed. Paige s method also did not handle union types, i.e. sets with di erent element types. Our precise complexity analysis, not just ....

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

....algorithm but also the same derivation except for the initial appearance of set di erence. We will use (6) for no particular reason. 4 3 Approach for deriving a complete implementation Notation. We use a set based language for deriving a complete implementation. The language is based on SETL [15, 16] extended with a xed point operation [3] Primitive data types are sets, pairs, and maps, i.e. binary relations represented as sets of pairs. Their syntax and operations on them are summarized below: fX1 ; Xng a set with elements X1 , Xn [X1 ; X2 ] a pair with elements X1 and X2 f[X1 ....

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

....algorithm but also the same derivation except for the initial appearance of set di erence. We will use (7) for no particular reason. 4 3 Approach for deriving a complete implementation Notation. We use a set based language for deriving a complete implementation. The language is based on SETL [15, 16] extended with a xed point operation by Cai and Paige [3] Primitive data types are sets and maps, i.e. binary relations represented as sets of pairs. Their syntax and operations on them are summarized below: fX1 ; Xng a set with elements X1 , Xn f[X1 ; Y1 ] Xn ; Yn ]g a map ....

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

....in [17, 25, 11] copy forms are common in grammars, selector forms are rst seen in [25] and conditional forms have counterparts in [4, 20] Overall, the constraints and simpli cations rules here extend those by Jones and Muchnick [25] Notation. We use a set based language. It is based on SETL [55, 56] extended with a xed point operation by Cai and Paige [10] we allow sets of heterogeneous elements and extend the language with pattern matching. Primitive data types are sets, tuples, and maps, i.e. binary relations represented as sets of 2 tuples. Their syntax and operations on them are ....

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

....results. Section 5 presents a few typical applications of the library. This report is concluded with a comparison of related work in Section 6 and a short conclusion in Section 7. 2 Key Features Our C library for symbolic computing is based on the runtime model of the SETL programming language[7], and naturally, we shall therefore refer to it as LIBSETL. SETL was selected for its runtime model partly because the language supports many features desirable for a symbolic computing library, and partly because the SETL features are available in imperative syntax and semantics which can be ....

....be traced back to the design of the C programing language. Key Features An Advanced C Library for Symbolic Computing 3 of 18 This section introduces key features of LIBSETL through simple C code. Rationales of these features can be found in the description of the SETL programming language[7]. We omit detailed explanations of them due to the scope of the report. 2.1 Latent Types LIBSETL has a latent type system, and every variable used with the library must be declared as of type SETL. A SETL variable has an internal latent type associated with its actual value, which can be an ....

J. T. Schwartz, R. B. Dewar, E. Dubinsky and E. Schonberg, Programming with Sets: An Introduction to SETL, Springer-Verlag, New York, 1986.

....standard forms are as in [14, 22, 9] copy forms are common in grammars, selector forms are rst seen in [22] and conditional forms have counterparts in [3, 17] Overall, the constraints here extend those by Jones and Muchnick [22] Notation. We use a set based language. It is based on SETL [41, 42] extended with a xed point operation by Cai and Paige [8] we allow sets of heterogeneous elements and extend the language with pattern matching. Primitive data types are sets, tuples, and maps, i.e. binary relations represented as sets of 2 tuples. Their syntax and operations on them are ....

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

....declarations etc. Furthermore, values of relation types adhere to standard naming, typing, binding, scoping and persistence rules. A closer look at DBPL reveals, however, some complications inherent in all bulk types (relations, maps, etc. that are to provide associative element access [ART91, SDDS86, SFL83] In DBPL, the key of a relation defines a list of components of the relation element type that uniquely determines each relation element. Key components have to define total functions over the domain of possible relation elements. Therefore, they must not be components of variant sections ....

.... of a iterations based on its properties expressed by a predicate analogous to the de setting operation, as found, for example, in Adaplex [SFL83] or DBPL (the, theOnly, theFirst, theLast) Similar iteration abstractions for specialized bulk types are discussed, for example, in [OBBT89, AM87, SDDS86] Note that the module iter in the Tycoon environment provides a very general and highly reusable functionality. For example, suppose an application has to operate on stacks of rectangles and lists of line segments, the operations in the module iter provide a building block for a declarative ....

J.T. Schwartz, R.B.K. Dewar, E. Dubinski, and E. Schonberg. Programming with Sets: An Introduction to SETL. Texts and Monographs in Computer Science. Springer-Verlag, 1986.

....Programming Delta 49 ment, and the failure and success statements with the expected meaning. The failure and success statements are present in many imperative languages that support automatic backtracking, the most known of them being Icon (see Griswold and Griswold [1983] and SETL (see Schwartz et al. 1986]) The language Icon allows for nondeterministic constructors similar to our ORELSE and SOME statements. In order to explore the full set of branches of a nondeterministic construction the user can use the every statement, which resembles our FORALL statement. However, in Icon all the choice ....

Schwartz, J. T., Dewar, R. B. K., Dubinsky, E., and Schonberg, E. 1986. Programming with Sets---An Introduction to SETL. Springer-Verlag, New York.

....A Decision Procedures for Ground General Uni cation 49 B Matrix for Term Propagation 52 C Matching of Bounded Set Terms 54 3 1 Introduction The problem of providing algorithms for the manipulation of set structures has received increasing attention in recent years. Various declarative languages [15, 30, 22, 48, 12] rely on sets, or structures with similar properties, as rst class objects. Similarly, a variety of works dealing with computability properties and algorithmic manipulation of set structures have recently appeared in contexts like automated deduction [44] and database systems [34] Additionally, ....

Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., and Schonberg, E. Programming with Sets: an Introduction to SETL, Springer Verlag, 1986.

....capabilities, and with a high power not only for the specification of problems but also for the support of solving methods. This has been convincingly argued in [Bee88] and is demonstrated by the long life and renewed vitality of the imperative set based programming language described in [SDDS86], SETL. In recent years, the theme of embedding sets, either flat (cf. BNST91] or nested (cf. DOPR92, DR93, Leg93] in a logic programming language has been tackled by quite a number of articles. Accordingly, symbolic techniques regarding sets have been combined with the usual evaluation ....

J. T. Schwartz, R. K. B. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An introduction to SETL. Texts and Monographs in Computer Science. Springer-Verlag, 1986.

....symbolic set manipulation can be a valuable aid to the researcher who wants to perform experiments in hopes of building the insight that might be needed to solve this type of problem. Some computer languages allow the user to write expressions which describe power sets. In SETL, for example, see Schwartz et al. 1986)) 2 A can be written as POWA, or by de ning a mapping from A to the set (0; 1) However, SETL s use of hash tables 0747 7171 90 000000 00 03.00 0 c 2000 Academic Press Limited 2 David Berque, Ronald Cecchini, Mark Goldberg, Reid Rivenburgh to store every set, regardless of how the set was ....

Schwartz, J. T., Dewar, R.B.K, Dubinsky, E. and Schonberg, E., Programming with Sets: An Introduction to SETL, Springer-Verlag New York, (1986).

....constructor is simple to add to the traditional relational data model, the set constructor requires a number of interesting new ideas since it leads to quantification over sets, a non first order feature. Similar set constructs are also used in general purpose programming languages such as SETL [43]. Of interest to databases is the development of calculi, algebra and rule based languages for such structured objects which allows to naturally incorporate them in dooD systems. The introduction of the set constructor in a rule based language [16, 4, 34] leads to problems resembling those ....

J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. SpringerVerlag, New-York, 1986.

....setting it is desirable to be able to bind an identifier to a function, apply it, watch it either work or err, potentially iterating the process until a working version is settled upon. Variables are lexically scoped elsewhere, as in C or Scheme. For more information on the ISETL language, see [4, 7, 5]. Intricacies in any ISETL expressions appearing later in this thesis will be explained in their context. As it stood, ISETL had no provisions for explicitly denoting parallelism. Algorithms written in ISETL and the virtual machine that would execute them were ripe with opportunity for exploiting ....

....loops, consider what happens below. We would be inclined to think that is a valid transformation. There is a problem, though, with the observation that the loops could be run in parallel, since there are, under analysis 39 First run. Second run. Sequential version. v; v; v; [1, 2, 4, 4, 5]; 1, 2, 4, 5, 5] 2, 3, 4, 5, 6] Nondeterminism Figure 5.5: Nondeterminism used for languages like C or Fortran, no cross iteration dependencies. Look at what consecutive Parallel ISETL runs of the cdoall code from the above example produces below. We see we did not preserve sequential ....

[Article contains additional citation context not shown here]

Schwartz J.T., R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986.

....More importantly, they make essential use of a new mechanical proof checking capability found in NAP (a set theoretic proof checker designed and implemented by the first author) for verifying the most difficult transformations in our derivations. 2.1. Notation The SETL like notation (see [70] [74], and [80] to be used throughout this paper is a concise variant of standard mathematical notation augmented with conventional dictions as may be found in an imperative programming language like Algol. Besides the usual elementary datatypes, SETL includes built in datatypes for finite tuples ....

....[a 0 ; b 0 ] 2 Rja 0 6= a Psi with[a; b] which preserves the single valued nature of R. SETL constant om denotes a special undefined value, and can be used to remove an element from the domain of a map, as in the example R(a) om Finally, it is useful to follow the SETL (see [80] and [74]) convention of allowing Boolean valued bounded existential quantifiers 9x 2 SjK to have a side effect assignment. Whenever the quantifier evaluates to true, then variable x is assigned an arbitrary value that belongs to S and to the truth set of qualifier K. This convention allows us to use such ....

Schwartz, J., Dewar, R., Dubinsky, E., and Schonberg, E., Programming with Sets: An Introduction to SETL, Springer-Verlag, New York, 1986.

..... 393 A.44 webutil.setl . 394 Bibliography 398 xiii Chapter 1 Introduction Public network services have to be coherent, reliable, and responsive in the face of errors, failures, attacks, and intermittent resource scarcity. SETL [181] turns out to be a convenient and powerful tool for dealing with this challenging environment. This dissertation describes extensions to SETL that are useful in data processing, especially when the Internet and numerous processes are involved. It is intended to serve as a tutorial on the design of ....

....that have been added to SETL. Subsequent chapters deal with the more network specific provisions, and illustrate the design patterns I have found most effective in the use of these new tools. 23 Chapter 2 Environmentally Friendly I O The CIMS version of SETL as described by Schwartz et al. [181] already had many features and characteristics that made it useful as a data processing language, both in general because of its high level nature and in particular because of such extensions as the SNOBOL inspired string pattern matching routines. However, the implementation was not packaged in ....

[Article contains additional citation context not shown here]

J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, 1986.

No context found.

SCHWARTZ, J., AND DEWAR, R. 1986. Programming with Sets---An Introduction to SETL. SpringerVerlag, New York.

No context found.

Schwartz, J. T., Dewar, R. B. K., Dubinsky, E. and Schonberg, E. Programming with Sets: An Introduction to SETL. Springer Verlag, Berlin, 1986.

No context found.

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, 1986.

No context found.

Schwartz, J., Dewar, R., Dubinsky, E., and Schonberg, E. Programming with Sets: an Introduction to SETL. Springer-Verlag, Berlin, 1986.

No context found.

J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, New York, 1986.

No context found.

Schwartz, J. T., Dewar, R. B. K., Dubinsky, E., and Schonberg, E. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986.

No context found.

J. Schwartz et al. Programming with Sets: Introduction to SETL. SpringerVerlag, 1986.

No context found.

Schwartz, J. T., et al. Programming with sets: An Introduction to SETL. Springer-Verlag, 1986.

No context found.

#83# J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, Berlin, Heidelberg, New York, 1986. #84# Olin Shivers. Control #ow analysis in scheme. In Proceedings of the ACM SIGPLAN '88 ConferenceonProgramming Language Design and Implementation, pages 164#

First 50 documents  Next 50

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