Reductivity

Science of Computer Programming

Volumn 26, Issue 1-3, 1996, Pages 217-236

  Doornbos, Henk ^a   Backhouse, Roland ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; ITERATIVE METHODS; RECURSIVE FUNCTIONS; SYSTEMS ANALYSIS;

DATA TYPE; DIVIDE AND CONQUER ALGORITHMS; INDUCTIVITY; INITIALITY; POLYTYPIC PROGRAMMING; REDUCTIVITY;

PROGRAMMING THEORY;

EID: 0030148232     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(95)00027-5     Document Type: Article

References (12)

1. R.C. Backhouse, M. Bijsterveld, R. van Geldrop and J.C.S.P. van der Woude, Categorical fixed point calculus, in: D. Pitt, D.E. Rydeheard and P. Johnstone, eds., Category Theory and Computer Science, Proc. 6th Internat. Conf., Lecture Notes in Computer Science, Vol. 953 (Springer, Berlin, 1995) 159-179.
2. R.S. Bird, O. de Moor and P. Hoogendijk, Generic functional programming with types and relations, J. Fund. Programming (1995) To appear.
3. H. Doombos and R.C. Backhouse, Induction and recursion on datatypes, in: B. Möller, ed., Mathematics of Program Construction, 3rd Internat. Conf., Lecture Notes in Computer Science, Vol. 947 (Springer, Berlin, 1995) 242-256.
4. P. Freyd, Algebraically complete categories, in: G. Rosolini A. Carboni and M.C. Pedicchio, eds., Category Theory, Proc., Como 1990, Lecture Notes in Mathematics, Vol. 1488 (Springer, Berlin, 1990) 95-104.
5. J. Jeuring, Polytypic pattern matching, in: S. Peyton Jones, ed., Proc. Functional Programming Languages and Computer Architecture, FPCA '95 (1995).
6. J. Lambek, A fixpoint theorem for complete categories, Math. Z., 103 (1986) 151-161.
7. G. Malcolm, Data structures and program transformation, Sci. Comput. Programming 14 (2-3) (1990) 255-280.
8. E. Meijer, M.M. Fokkinga and R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, in: FPCA91: Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, Vol. 523 (Springer, Berlin, 1991) 124-144.
9. E. Meijer and J. Jeuring, Merging monads and folds for functional programming, in: J. Jeuring and E. Meijer, eds., Advanced Functional Programming, Lecture Notes in Computer Science, Vol. 925, 228-266 (Springer, Berlin, May 1995).
10. G. Schmidt and T. Ströhlein, Relations and Graphs, Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science (Springer, Berlin, 1993).
11. D. Swierstra and O. de Moor, Virtual data structures, in: Helmut Partsch, Bernhard Möller and Steve Schuman, eds., Formal Program Development, Lecture Notes in Computer Science, Vol. 755 (Springer, Berlin, 1993) 355-371.
12. P. Wadler, Comprehending monads, in: ACM Conf. on Lisp and Functional Programming, 1990.