A Generic Programming Extension for Clean

Implementation of Functional Languages

2004

Self Cite

Abstract. It is important to be able to program GUI applications in a fast and easy manner. Current GUI tools for creating visually attractive applications offer limited functionality. In this paper we introduce a new, easy to use method to program GUI applications in a pure functional language such as Clean or Generic Haskell. The method we use is a refined version of the model-view paradigm. The basic component in our approach is the Graphical Editor Component (GECτ ) that can contain any value of any flat data type τ and that can be freely used to display and edit its value. GEC τ s can depend on others, but also on themselves. They can even be mutually dependent. With these components we can construct a flexible, reusable and customizable editor. For the realization of the components we had to invent a new generic implementation technique for interactive applications.

Section: Combining Graphical Editor Componentsmentioning

confidence: 99%

“…2). [Int] window displaying an editable list (initially [1,5,2,8,3,9]) and an non-editable GEC TreeInt window showing the effect of applying the function toBalancedTree to that list.…”

Section: Combining Graphical Editor Componentsmentioning

confidence: 99%

“…Recently, generic functions have been added to Clean [3]. A generic function is an ultimate reusable function that allows reflection on the structure of any data in a type safe way.…”

Section: Generic Functionsmentioning

confidence: 99%

“…In order to be able to deal with (mutual) recursive types, it is vital that these transformations are done in a lazy way (see [14] and [3]). …”

Section: Generic Functionsmentioning

confidence: 99%

See 2 more Smart Citations

Generic Graphical User Interfaces

Achten

Eekelen

Implementation of Functional Languages

2004

Self Cite

“…As a host language, we use the pure functional programming language Clean [18]. Clean is a state-of-art programming language with support for Algebraic Data Types (ADTs), generic programming [1], and features the generic test tool G∀ST [6] that is used in this work to implement the testing framework.…”

Section: Introductionmentioning

confidence: 99%

Model-Based Testing of Thin-Client Web Applications and Navigation Input

Koopman

Achten

Practical Aspects of Declarative Languages

Self Cite

Abstract. In this paper we present a novel automated, on-line, modelbased testing system for on-the-fly testing of thin-client web applications. Web applications are specified by means of Extended State Machines. To handle dynamic web applications, arbitrarily large and complex state input and output types, and the transport of information from the webpage to the state of the specification, we define a new, ioco like, conformance relation. In this conformance relation a specification is a function from state and input to functions from output to the new states. The implementation builds on the G∀ST test tool and spots errors in real web applications.

Dynamic Construction of Generic Functions

Schreur

Implementation and Application of Functional Languages

2005

Self Cite

This p a p e r is a b o u t co n stru ctin g generic functions for dynam ically ty p ed values (or shortly, dynam ics). L et us first explain w h at we m ean by generic functions and dynam ics. In Generic Haskell [13] as well as in Clean [15] it is possible to define g en eric fu n c tio n s [4,8]. A generic function is an u ltim a te reusable function th a t allows reflection on th e stru c tu re of d a ta in a type-safe way. O nce defined, a generic function can be applied on any value of any given concrete sta tic type. G eneric functions can be used to define work th a t is of a general n a tu re. T he technique has successfully been applied to define functions like equality, m a p , fo ld , to co n stru ct parsers and p re tty printers, to create GUI applications [3] an d to g enerate te st d a ta [10]. A generic function is actu ally n o t a single function, b u t ra th e r a special kind of overloaded function. To define a generic function, instances for th e generic function are defined for a finite num ber of ty p e constructors. Given these base instances, th e com piler can fully au to m atically derive an instance for th e generic function for any given concrete sta tic type. B o th in Haskell as well as in Clean one can use d yn a m ic s. D ynam ics allow the program m er to associate a ru n-tim e value w ith its type. T he are some differences betw een dynam ics in Haskell and in Clean. In Clean dynam ics are in corporated in th e language while in Haskell dynam ics are m ade available via a lib ra ry fa cility. D ynam ics in Clean can be of polym orphic type, and one can do run-tim e ty p e unification using ty p e p a tte rn variables [14]. F urtherm ore, dynam ics (even