H. John Reekie. Visual haskell: A first attempt. Technical Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology Sydney, August 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... presentations in visual functional programming There are two approaches to representing the components in a program, one is to translate the a program into visual representation directly, where the combination of program components is directed by the textual language syntax, such as Visual Haskell [46] and U. Schreiweis [51] Prolog Programming environment . Another approach is using a metaphor to guide the combination of program components, e.g. VisaVis [45] Pygmalion [57] and Clarity [1] In the rst category, some visual programming systems go little further than to translate a standard ....

....a metaphor to guide the combination of program components, e.g. VisaVis [45] Pygmalion [57] and Clarity [1] In the rst category, some visual programming systems go little further than to translate a standard programming language into a visual representation. A good example is Visual Haskell [46]. Visual Haskell [46] is a attempt to develop a visual equivalent for the Haskell functional language. It is intended both as a program visualization tool and as a programming language in its own right. The approach used a translation from Haskell into an intermediate form VHIF with visual ....

[Article contains additional citation context not shown here]

H. J. Reekie. Visual Haskell: a rst attempt. Technical Report Research Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, 1994.

....constructs may be given graphical representations. Cardelli s proposal is based on icons with different shapes and enclosed symbols or labels for different constructs. In Pagan s FP system[Pag87] there are labeled rectangular representations of all constructs. In Reekie s proposed Visual Haskell[Ree94], labeled graphical constructs are are joined together within enclosing boxes by arcs. This approach leads to large numbers of similar representations which require text to distinguish between them but are substantially bulkier than the equivalent program code. Thus, less efficient use is made of ....

H. J. Reekie. Visual Haskell: a first attempt. Technical Report Research Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, August 1994.

....become apparent. Because the visual language is general that is, it is a visual notation for Haskell and it not particularly oriented towards signal processing it promises to be a powerful tool for functional programming in general. The presentation in chapter 4 and in an earlier paper [117] are written assuming that Visual Haskell will be used as a visual functional language, not as a visual dataflow language. The connection between functional languages and pipeline dataflow (more specifically, dataflow process networks see chapter 3) provides a new implementation model for a ....

....slots, and timestamps, which mark the times of occurrence of tokens. Chapter 6 of this thesis is a complete revision of this paper; in particular, a new form of timed stream is developed, and the music synthesiser example is extended. CHAPTER 1. INTRODUCTION 10 Visual Haskell: A First Attempt [117] is the only paper I have written devoted to explaining Visual Haskell, the final form of the visual language developed and refined over the last few years. Chapter 4 is a revised version of the core of this paper. The visual language is slightly improved, but the way in which the visual syntax is ....

[Article contains additional citation context not shown here]

H. John Reekie. Visual Haskell: A first attempt. Technical Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, August 1994. FTP from ftp.ee.uts.edu.au as /pub/prose/visual-haskell.ps.gz. BIBLIOGRAPHY 204

....implementation was in progress when the paper was written; for a detailed description of the final implementation see Meyer s report [96] Again, I have decided against including this material in the thesis, as I feel it is tangential to its main theme. Modelling Asynchronous Streams in Haskell [116] develops Haskell code for modelling timed streams. Two approaches are used: hiatons, which mark empty slots, and timestamps, which mark the times of occurrence of tokens. Chapter 6 of this thesis is a complete revision of this paper; in particular, a new form of timed stream is developed, and ....

H. John Reekie. Modelling asynchronous streams in Haskell. Technical Report 94.3, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, June 1994. FTP from ftp.ee.uts.edu.au as /pub/prose/async-streams.ps.gz.

....become apparent. Because the visual language is general that is, it is a visual notation for Haskell and it not particularly oriented towards signal processing it promises to be a powerful tool for functional programming in general. The presentation in chapter 4 and in an earlier paper [117] are written assuming that Visual Haskell will be used as a visual functional language, not as a visual dataflow language. The connection between functional languages and pipeline dataflow (more specifically, dataflow process networks see chapter 3) provides a new implementation model for a ....

....hiatons, which mark empty slots, and timestamps, which mark the times of occurrence of tokens. Chapter 6 of this thesis is a complete revision of this paper; in particular, a new form of timed stream is developed, and the music synthesiser example is extended. Visual Haskell: A First Attempt [117] is the only paper I have written devoted to explaining Visual Haskell, the final form of the visual language developed and refined over the last few years. Chapter 4 is a revised version of the core of this paper. The visual language is slightly improved, but the way in which the visual syntax is ....

[Article contains additional citation context not shown here]

H. John Reekie. Visual Haskell: A first attempt. Technical Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, August 1994. FTP from ftp.ee.uts.edu.au as /pub/prose/visual-haskell.ps.gz.

....when the paper was written; for a detailed description of the final implementation see Meyer s report [96] Again, I have decided CHAPTER 1. INTRODUCTION 10 against including this material in the thesis, as I feel it is tangential to its main theme. Modelling Asynchronous Streams in Haskell [116] develops Haskell code for modelling timed streams. Two approaches are used: hiatons, which mark empty slots, and timestamps, which mark the times of occurrence of tokens. Chapter 6 of this thesis is a complete revision of this paper; in particular, a new form of timed stream is developed, and ....

H. John Reekie. Modelling asynchronous streams in Haskell. Technical Report 94.3, Key Centre for Advanced Computing Sciences, University of Technology, Sydney, June 1994. FTP from ftp.ee.uts.edu.au as /pub/prose/async-streams.ps.gz.

No context found.

H. John Reekie. Visual haskell: A first attempt. Technical Report 94.5, Key Centre for Advanced Computing Sciences, University of Technology Sydney, August 1994.

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