Sigbjorn Finne and Simon L. Peyton Jones. Pictures: A simple structured graphics model. In Proceedings of Glasgow Functional Programming Workshop, July 1995.  @ NUS  Home/Search   Document Details and Download   Summary   Related Articles   Check

....during, mapping time intervals to # intervals, has the property that at[ b] t during[ b] I for any # valued behavior b, time interval I, and time t I. An interval is represented simply as a pair of values: data Ivl a = a Upto a For instance, 3 Upto 10 represents the interval [3,10], i.e. the set of x such that 3 10. The implementation of a behavior then contains both the time sampling and interval sampling functions: Behavior (Time (a, Behavior a) Ivl Time (Ivl a, Behavior a) As an example, the behavior time maps times and time intervals to themselves, and ....

....idea. 5 Related Work Henderson s functional geometry [12] was one of the first purely declarative approaches to graphics, although it does not deal with animation or reactivity. Several other researchers have also found declarative languages well suited for modeling pictures. Examples include [15, 23, 3, 10]. Arya used a lazy functional language to model 2D animation as lazy lists of pictures [1, 2] constructed using list combinators. While this work was quite elegant, the use of lists implies a discrete model of time, which is somewhat unnatural. Problems with a discrete model include the fact ....

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Glasgow Functional Programming Workshop, Ullapool, July 1995.

....takes 2 pipelines of arguments and returns a pipeline of results; etc. For example, pipe2 ( creates a version of the multiplication function (written as ( in FVision) which operates on two pipelines of numbers, yielding a pipeline of products: 2 3 = 6 pipe2 ( pipe [2,3,4] pipe [3,4,5]) pipe [6,12,20] pipe2 ( pipe0 2) pipe [3,4,5] pipe [6,8,10] Pipelines may be split or joined using these functions: joinPipe : Pipe a Pipe b Pipe (a, b) splitPipe : Pipe (a, b) Pipe a, Pipe b) For example: joinPipe (pipe [1,2,3] pipe [4,5,6] pipe ....

....of results; etc. For example, pipe2 ( creates a version of the multiplication function (written as ( in FVision) which operates on two pipelines of numbers, yielding a pipeline of products: 2 3 = 6 pipe2 ( pipe [2,3,4] pipe [3,4,5] pipe [6,12,20] pipe2 ( pipe0 2) pipe [3,4,5]) pipe [6,8,10] Pipelines may be split or joined using these functions: joinPipe : Pipe a Pipe b Pipe (a, b) splitPipe : Pipe (a, b) Pipe a, Pipe b) For example: joinPipe (pipe [1,2,3] pipe [4,5,6] pipe [ 1,4) 2,5) 3,6) splitPipe (pipe [ 1,4) 2,5) 3,6) pipe ....

[Article contains additional citation context not shown here]

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Glasgow Functional Programming Workshop, Ullapool, July 1995.

....subproblems to get solutions to more complex problems. It is assumed that all the solutions can be represented as combinations of smaller solutions. This technique is common in functional programming, and was used not only for the parsing problem, but also for algebraic representation of pictures [FJ95] for expressing music with functional notation [Hud96] and to construct hypermedia documents [SMLR97] The functional implementation of the combinator technique provides functions to represent combination of solutions these functions are called combinators . To implement parsing ....

Sigborn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Proccedings of the Glasgow Workshop on Functional Programming, Ullapool, 1995.

....language for a new domain. Examples are the functional parsing combinators of Hutton [7] the geometric region server language reported in Carlson et al. 4] the Haskore music notating language of Hudak et al. 6] and the picture specification language reported by Finne and Peyton Jones [5]. Yet none of them make the observation that a set of combinators very similar to those used to performed the functional computation could be defined so as to generate conventional language code. As a dual data point, Spinellis [12] describes the the programming of the Glasgow Haskell compiler as ....

S. Finne, S. Peyton Jones, Pictures: A simple structured graphics model, Dept. of Computing Science, Univ. of Glasgow, 1996.

....during, mapping time intervals to ff intervals, has the property that at[ b] t 2 during[ b] I for any ff valued behavior b, time interval I, and time t 2 I. An interval is represented simply as a pair of values: data Ivl a = a Upto a For instance, 3 Upto 10 represents the interval [3,10], i.e. the set of x such that 3 x 10. The implementation of a behavior then contains both the time sampling and interval sampling functions: data Behavior a = Behavior (Time (a, Behavior a) Ivl Time (Ivl a, Behavior a) As an example, the behavior time maps times and time intervals ....

....idea. 5 Related Work Henderson s functional geometry [12] was one of the first purely declarative approaches to graphics, although it does not deal with animation or reactivity. Several other researchers have also found declarative languages well suited for modeling pictures. Examples include [15, 23, 3, 10]. Arya used a lazy functional language to model 2D animation as lazy lists of pictures [1, 2] constructed using list combinators. While this work was quite elegant, the use of lists implies a discrete model of time, which is somewhat unnatural. Problems with a discrete model include the fact that ....

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Glasgow Functional Programming Workshop, Ullapool, July 1995.

....robust and slow clock rates or garbage collection delays do not perturb the system enough to cause any real problems. 7 Related Work Several researchers have found declarative languages well suited for modeling pictures, 3D models, and even music. Examples include [Hen82, LZ87, Bar91, ZLL 88, FJ95, HMGW96] Arya used a functional language to model 2D animations as lazy lists of pictures constructed using list combinators [Ary94] While this work was quite elegant, the use of lists implies a discrete model of time, which is somewhat unnatural. The TBAG system modeled 3D animations as ....

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Proceedings of Glasgow Functional Programming Workshop, July 1995.

....action printW printer dump.ps printW : Printer String IO ( is executed, a PostScript 5 [1] representation of the current graphical output for the encapsulated component is generated. This is made possible by the device independent 2D graphics model used to describe graphical output [4], where pictures are described by composing parts, similar to that of [7, 20] 5 PostScript is trademark of Adobe Systems Incorporated. 5 Implementation Haggis is operational and currently only available for internal use at Glasgow. It will eventually be released as part of the Glasgow ....

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Glasgow Functional Programming Workshop, Ullapool, July 1995.

....components. The compositional model also extends to the application, where Haggis allows you to build larger and larger application blocks by combining existing ones together. ffl Functional structured graphics. All graphical output in Haggis is described declaratively using Picture values [7]. The task of converting this description into actual graphical output is taken care of by Haggis, freeing the programmer from having to be concerned about the underlying window system drawing interface. The device independent nature of a Picture value also means that the values can also be output ....

....(n div 3) n [0,4. 360] The spiral is constructed by repeatedly combining and transforming Picture values into bigger ones, Figure 1 contains a list of some of the common Picture combinators provided by Haggis, and for an introduction to this style of expressing structured graphics see [7]. The spiral is displayed in the usual manner: main = do wopen (glyph spiral) return ( Exercise 5: Implement the label action in terms of glyph. Exercise 6: With the help of the functions in Figure 1, write an abstraction that partitions and visualises a list of Ints in a pie chart. As an ....

Sigbjorn Finne and Simon Peyton Jones. Pictures: A simple structured graphics model. In Glasgow Functional Programming Workshop, Ullapool, July 1995.

No context found.

Sigbjorn Finne and Simon L. Peyton Jones. Pictures: A simple structured graphics model. In Proceedings of Glasgow Functional Programming Workshop, July 1995.

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

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.