J. T. O'Donnell, "Hydra: hardware description in a functional language using recursion equations and high order combining forms," The Fusion of Hardware Design and Verification, G. J. Milne (ed), Amsterdam: NorthHolland (1988) 309--328.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....write higher order combinators that take circuits as arguments and compose them in interesting ways e.g. a row of circuits all composed together. Much research work has been reported in this area by Steve Johnson (Daisy) 3] Mary Sheeran and Geraint Jones (FP and Ruby) 8] John O Donnell (Hydra)[6] and Miriam Lesser (HML) 5] One of the early hardware description languages to attract industrial interest was ELLA which is functional. This paper builds on this existing base of work, but shows how far we can go using just Haskell. Amajor weakness of almost all hardware description languages ....

John O'Donnell. Hydra: Hardware descriptions in a functional language using recursion equations and higher order combining forms, The Fusion of Hardware Design and Verification, G. J. Milne (ed), North-Holland, 1988.

.... as special cases of reactive systems have been the stimulation for a large body of stream processing research (see for example [84] 53] and [25] During the 1980s streams and STs have also been used extensively for hardware description, for example, 192] 193] 194] 65] 66] 95] [177] and [92] We note that the work of M Sheeran on Ruby, as discussed in [192] 193] and [194] above, includes a generalization of the representation of streams to the function space [Z A] wherein Zrepresents the integers) to avoid dealing with initial conditions in hardware specifications. ....

M J O'Donnell. Hydra: Hardware description in a functional language using recursion equations and high order combining forms. In G J Milne, editor, The Fusion of Hardware Design and Verification. North-Holland, 1988.

....succinctness of our notation enable circuits to be described very elegantly and quickly with practice, and that the system facilitates the rapid exploration of choices in designing a circuit to perform a particular function. Similar benefits have been reported for other hardware development tools [13, 12] based on functional languages. Our work has provided a basis for a design environment which enables the costeffective production of regular array circuits. Current research is directed towards enhancing the completeness, effectiveness and robustness of our tools, and extending them to encompass ....

J. T. O'Donnell, `Hydra: hardware description in a functional language using recursion equations and higher order combining forms'. In G. Milne, editor, Proceedings of International conference on the fusion of hardware design and verification, p. 305, Glasgow, 1988.

....of performing synthesis on expressions of a symbolic processing language is that these expressions can also be executed to model the design. Each of the intermediate expressions generated by DDD is a valid Scheme program, used to simulate and explore the implementation. O Donnell s HYDRA system [24] is a related study of this aspect of methodology. 3 Terminology, Syntax, and Elementary Algebra Our approach formalizes synthesis as a translation between dialects of a single modeling language of functional expressions. We use the term derivation to emphasize the character of this ....

John T. O'Donnell. HYDRA: Hardware description in a functional language using recursion equations and higher order combining forms. In G. Milne, editor, The Fusion of Hardware Design and Verification, pages 309--328, Amsterdam, July 1988. Horth-Holland.

....is popular in the Scheme research community, where its merits are almost taken as axiomatic, but it hasn t been used much by the functional programming community. The first computer hardware description language based on alternative semantic functions, rather than a collection of tools, was Hydra [2, 3, 4], designed and implemented by O Donnell between 1981 and 1986. Hydra was implemented on top of Daisy, an early functional language, and it used alternative base functions to define four semantic functions: 1. A behavioural function simulated the circuit. 2. A structural function generated the ....

....Now it s straightforward to define primitive components. These definitions are all higher order functions which still need to be applied to a CompName. comp11 k x = mkComp k [ x,0) 1] mkSingleton comp21 k x y = mkComp k [ x,0) y,1) 2] mkSingleton comp22 k x y = mkComp k [ x,0) y,1) [2,3] mkPair latch = comp11 latch inv = comp11 inv and2 = comp21 and2 or2 = comp21 or2 xor = comp21 xor2 halfAdd = comp22 halfAdd 5. Example: A shift register and its netlist Here is the behavioural specification of a general shift register [2] with three bit positions a, b and c, ....

[Article contains additional citation context not shown here]

J. T. O'Donnell, "Hydra: hardware description in a functional language using recursion equations and high order combining forms," The Fusion of Hardware Design and Verification, G. J. Milne (ed), Amsterdam: NorthHolland (1988) 309--328.

No context found.

John T. O'Donnell. Hydra: Hardware description in a functional language using recursion equations and high order combining forms. In George J. Milne, editor, The Fusion of Hardware Design and Verification, pages 309--328. North-Holland, Amsterdam, 1988.

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