Results 1 
4 of
4
Calculate Polytypically!
 In PLILP'96, volume 1140 of LNCS
, 1996
"... A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush" combinator that can be used to calculate polytypically. The ability to define functions polytypically adds an ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
(Show Context)
A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush" combinator that can be used to calculate polytypically. The ability to define functions polytypically adds another level of flexibility in the reusability of programming idioms and in the design of libraries of interoperable components.
Monadic Maps and Folds for Arbitrary Datatypes
 Memoranda Informatica, University of Twente
, 1994
"... Each datatype constructor comes equiped not only with a socalled map and fold (catamorphism), as is widely known, but, under some condition, also with a kind of map and fold that are related to an arbitrary given monad. This result follows from the preservation of initiality under lifting from the ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Each datatype constructor comes equiped not only with a socalled map and fold (catamorphism), as is widely known, but, under some condition, also with a kind of map and fold that are related to an arbitrary given monad. This result follows from the preservation of initiality under lifting from the category of algebras in a given category to a certain other category of algebras in the Kleisli category related to the monad.
Promotional Transformation on Monadic Programs
, 1995
"... this paper, we propose a new theory on monadic catamorphism bymoving Fokkinga's assumption on the monad to the condition of a map between monadic algebras so that our theory is valid for arbitrary monads including, for example, the state monad that is not allowed in Fokkinga's theory. Our ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
this paper, we propose a new theory on monadic catamorphism bymoving Fokkinga's assumption on the monad to the condition of a map between monadic algebras so that our theory is valid for arbitrary monads including, for example, the state monad that is not allowed in Fokkinga's theory. Our theory covers Fokkinga's as a special case. Moreover, Meijer and Jeuring's informal transformation rules of monadic programs in their case study is actually an instance of our general promotion theorem.
Design of the SDRR Pipeline
, 1995
"... Software Design for Reliability and Reuse (SDRR) is a program generation technology based on a core of reusable program transformation tools. This report outlines the toplevel design of the tools constructed in the proofofconcept demonstration project. The SDRR system was designed with goals of s ..."
Abstract
 Add to MetaCart
(Show Context)
Software Design for Reliability and Reuse (SDRR) is a program generation technology based on a core of reusable program transformation tools. This report outlines the toplevel design of the tools constructed in the proofofconcept demonstration project. The SDRR system was designed with goals of simplicity, redundant functionality, incremental development, interoperability, and structure preservation. To meet the requirements specification and accomplish these goals, a suite of tools was developed and integrated into a linear pipeline of program transformations forming a software component generator. We describe the design goals, the structure of the pipeline, and design issues raised in the development process. Contents 1 Introduction 2 2 Design Goals 3 2.1 Keep it simple : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 Minimize number of intermediate representations : : : : : : : : : : : : : : : : : : : : : : 3 2.3 Redundant functionality : ...