R. Cockett and T. Fukushima. Draft: About charity. Dept. of Computer Science, University of Calgary, Calgary, Alberta, Canada. Available via anonymous ftp from cpsc.ucalgary.ca., 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Inductive Data Types for Predicate Transformers - de Moor (1995) (4 citations) (Correct)
.... Data Types for Predicate Transformers Oege de Moor September 14, 1995 Keywords: programming calculi, refinement calculus, predicate transformers, data types, catamorphisms 0 Introduction Modern functional programming languages [5, 6] and specification formalisms [3] are built around the notion of inductive data types and homomorphisms on these data types. Such homomorphisms, which correspond to the familiar fold or reduce operators in functional programming, are called catamorphisms. In this note, it is shown how ....
R. Cockett and T. Fukushima. Draft: About charity. Dept. of Computer Science, University of Calgary, Calgary, Alberta, Canada. Available via anonymous ftp from cpsc.ucalgary.ca., 1991.
Between Dynamic Programming and Greedy: Data Compression - Bird, de Moor (1995) (5 citations) (Correct)
....Sizes[I] Sizes[I Gamma 1] C; SnocS(Codes[I] A) ELSE Sizes[I] Sizes[I Gamma Len] P; SnocP(Codes[I] Pos,Len) END; I : I 1; Read(A) END; EmitCodes(Codes,I) END Compact. Figure 1: Modula 2 program for data compression. namely the research in categorical programming languages (e.g. [10]) So far, however, that work has been confined to a strictly functional setting. Also, it does not incorporate pragmatic concepts like memoisation [18] which will be essential in our applications. ....
R. Cockett and T. Fukushima. Draft: About charity. Dept. of Computer Science, University of Calgary, Calgary, Alberta, Canada. Available via anonymous ftp from cpsc.ucalgary.ca., 1991.
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