Jones, G. Programming in `occam'. Tech. Rep. Technical Monograph PRG-43, Oxford University Computing Laboratory Programming Research, Group, Mar. 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....reason formally about a circuit, while still being able to draw its physical representation. The PowerList constructors can be found in Ruby as predefined relations. They are not given any special treatment; instead they are considered part of a tool box available to the circuit designer. In [JS91] Jones and Sheeran present recursive descriptions in Ruby of the Butterfly network, the Fast Fourier Transform algorithm, and Batcher s sorting networks. These descriptions were derived using geometrical considerations and are more complex than the corresponding PowerList descriptions given by ....

Geraint Jones and Mary Sheeran. Collecting butterflies. Technical Monograph PRG-91, Oxford University, February 1991.

....of n copies of R is given by R n , so R 4 = R ; R ; R ; R. Similarly repeated parallel composition is given by map n R: map 3 R = R; R; R] There are functions for capturing other patterns of replicating components and for building state machines; details of these can be found in [4] [5], 10] and [12] 3 Design mapping It is possible to implement a Ruby expression in a number of ways. For instance, the expression Q ; R can be implemented in hardware as two connected circuit blocks as shown in Figure 2a, or implemented in software in the form of C and occam programs. In this ....

....balance the hardware load and the software load. Our next example involves partitioning of a butterfly network. We shall need riffle n , a wiring operation similar to zip n but without some of the internal sequence structures in the domain and range data, to describe a perfect shuffle architecture [5]: hx 0 ; x 1 ; x n Gamma1 ; y 0 ; y 1 ; y n Gamma1 i riffle n hx 0 ; y 0 ; x 1 ; y 1 ; x n Gamma1 ; y n Gamma1 i: One can show that riffle n = group 2;n ; zip n ; group Gamma1 n ;2 . A parametrised butterfly network can be defined using riffle n : bfy n R = ....

G. Jones and M. Sheeran, Collecting Butterflies, Technical Monograph PRG--91, Oxford University Programming Research Group, February 1991.

....the compilation of polymorphic records of Ohori [21] Our algorithm on the other hand is a source to source transformation. Moreover, Minamide s algorithm deals only with the Core ML calculus whereas we have implemented our algorithm on the entire SML 97 language with higher order modules. Jones [11] has also worked on a similar problem related to dictionary passing in Haskell and Gofer. Type classes in these languages are implemented by passing dictionaries at runtime. Dictionaries are tuples of functions that implement the methods defined in a type class. Consider the following Haskell ....

....it in as a parameter. This is repeated for all overloaded functions so that all dictionaries are constructed statically. But this approach does not work with separately compiled modules since f s type in other modules does not specify the dictionaries that are constructed inside it. In Gofer [11], instance declarations are not used to simplify the context. Therefore the type of f in the above example would be Eq[a] a a Bool. Jones optimisation of dictionary passing can now be performed in the presence of separately compiled modules. However, we now require a more complicated type ....

[Article contains additional citation context not shown here]

M. P. Jones. Qualified Types: Theory and Practice. PhD thesis, Oxford University Computing Laboratory, Oxford, july 1992. Technical Monograph PRG-106.

....hand is a sourceto source transformation. Finally, Minamide s algorithm deals only with the Core ML calculus and does not mention how his method may be extended to ML style modules. On the other hand, we have implemented our algorithm on the entire SML 97 language with higher order modules. Jones [11] has also worked on a similar problem related to the implementation of type classes in Haskell [8] and Gofer [11] Type classes in these languages are implemented by dictionary passing and if done naively, can lead to the same dictionaries being created repeatedly. We will briefly compare our ....

....does not mention how his method may be extended to ML style modules. On the other hand, we have implemented our algorithm on the entire SML 97 language with higher order modules. Jones [11] has also worked on a similar problem related to the implementation of type classes in Haskell [8] and Gofer [11]. Type classes in these languages are implemented by dictionary passing and if done naively, can lead to the same dictionaries being created repeatedly. We will briefly compare our approach with his optimisations on dictionary passing. Since the type systems and the implementation of dictionaries ....

[Article contains additional citation context not shown here]

M. P. Jones. Qualified Types: Theory and Practice. PhD thesis, Oxford University Computing Laboratory, Oxford, july 1992. Technical Monograph PRG-106.

No context found.

Jones, G. Programming in `occam'. Tech. Rep. Technical Monograph PRG-43, Oxford University Computing Laboratory Programming Research, Group, Mar. 1985.

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