Final dialgebras : from categories to allegories
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 33 (1999) no. 4-5, pp. 401-426.
@article{ITA_1999__33_4-5_401_0,
     author = {Backhouse, Roland and Hoogendijk, Paul},
     title = {Final dialgebras : from categories to allegories},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {401--426},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {4-5},
     year = {1999},
     zbl = {0943.68014},
     mrnumber = {1748664},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1999__33_4-5_401_0/}
}
TY  - JOUR
AU  - Backhouse, Roland
AU  - Hoogendijk, Paul
TI  - Final dialgebras : from categories to allegories
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
DA  - 1999///
SP  - 401
EP  - 426
VL  - 33
IS  - 4-5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1999__33_4-5_401_0/
UR  - https://zbmath.org/?q=an%3A0943.68014
UR  - https://www.ams.org/mathscinet-getitem?mr=1748664
LA  - en
ID  - ITA_1999__33_4-5_401_0
ER  - 
%0 Journal Article
%A Backhouse, Roland
%A Hoogendijk, Paul
%T Final dialgebras : from categories to allegories
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 401-426
%V 33
%N 4-5
%I EDP-Sciences
%G en
%F ITA_1999__33_4-5_401_0
Backhouse, Roland; Hoogendijk, Paul. Final dialgebras : from categories to allegories. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 33 (1999) no. 4-5, pp. 401-426. http://www.numdam.org/item/ITA_1999__33_4-5_401_0/

[1] C. J. Aarts, R. C. Backhouse, P. Hoogendijk, T. S. Voermans and J. Van Der Woude, A relational theory of datatypes. Available via World-Wide Web at http://www.win.tue.nl/cs/wp/papers (September 1992).

[2] P. Aczel, Non Well-Founded Sets, Number 14 in CSLI Lecture Notes. Center for the Study of Language and Information (Stanford, California, 1988). | MR | Zbl

[3] P. Aczel and N. Mendler, A final coalgebra theorem, D.H. Pitt, Ed., Category Theory and Computer Science. Springer Verlag, Lecture Notes in Comput. Sci. (1989) 357-365. | MR

[4] R. C. Backhouse, P. De Bruin, P. Hoogendijk, G. Malcolm, T. S. Voermans and J. Van Der Woude, Polynomial relators, M. Nivat, C.S. Rattray, T. Rus and G. Scollo, Eds., in Proc. of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST'91. Springer-Verlag, Workshops in Computing (1992) 303-326.

[5] R. Bird, O. De Moor and P. Hoogendijk, Generic functional programming with types and relations. J. Funct. Programming 6 (1996) 1-28. | MR | Zbl

[6] R. S. Bird and O. De Moor, Algebra of Programming. Prentice-Hall International (1996). | Zbl

[7] H. Doornbos, Reductivity arguments and program construction. Ph. D. Thesis, Eindhoven University of Technology, Department of Mathematics and Computing Science (1996). | MR | Zbl

[8] P. J. Freyd and A. Ščcedrov, Categories, Allegories. North-Holland (1990). | MR | Zbl

[9] T. Hagino, A typed lambda calculus with categorical type constructors, D. H. Pitt, A. Poigne and D. E. Rydeheard, Eds., Category Theory and Computer Science. Springer-Verlag, Lecture Notes in Comput Sci. 283(1988) 140-57. | MR | Zbl

[10] P. Hoogendijk, A Generic Theory of Datatypes. Ph. D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1997). | MR | Zbl

[11] P. Hoogendijk and R. Backhouse, When do datatypes commute? E. Moggi and G. Rosolini, Eds., Category Theory and Computer Science, 7th International Conference. Springer-Verlag, Lecture Notes in Comput Sci. 1290 (1997) 242-260. | MR | Zbl

[12] P. Hoogendijk and O. De Moor, What is a datatype? Technical Report 96/16, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1996. J. Funct. Programming, to appear.

[13] B. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 62 (1997) 222-259. | Zbl

[14] P. Jansson and J. Jeuring, PolyP - a polytypic programming language extension. In POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press (1997) 470-482.

[15] C. B. Jay, A semantics for shape. Sci. Comput Programming 25 (1995) 251-283. | MR | Zbl

[16] C. B. Jay and J. R. B. Cockett, Shapely types and shape polymorphisim, D. Sannella, Ed., SOP '94' 5th European Symposium on Programming. Springer Verlag, Lecture Notes in Comput. Sci. (1994) 302-316. | MR

[17] J. Jeuring, Polytypic pattern matching. In Conference Record of FPCA '95, SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture (1995) 238-248.

[18] J. Jeuring and P. Jansson, Polytypic programming, J. Launchbury, E. Meijer and T. Sheard, Eds., Proceedings of the Second International Summer School on Advanced Functional Programming Techniques. Springer-Verlag, Lecture Notes in Comput. Sci. 1129 (1996) 68-114.

[19] J. Lambek, A fixpoint theorem for complete categories. Math. Z. 103 (1968) 151-161. | MR | Zbl

[20] J. Lambek, Subequalizers. Canad. Math. Bull. 13 (1970) 337-349. | MR | Zbl

[21] S. Maclane, Categories for the Working Mathematician. Springer-Verlag, New York (1971). | MR | Zbl

[22] L. Meertens, Calculate polytypically! H. Kuchen and S. Doaitse Swierstra, Eds., Proceedings of the Eighth International Symposium PLILP '96 Programming Languages: Implementations, Logics and Programs. Springer Verlag, Lecture Notes in Comput. Sci. 1140 (1996) 1-16.

[23] 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. Springer-Verlag, Lecture Notes in Comput. Sci. 523 (1991) 124-144. | MR

[24] S.D. Swierstra and O. De Moor, Virtual data structures, H. Partsch, B. Möller and S. Schuman, Eds., Formal Program Development. Springer-Verlag, Lecture Notes in Comput. Sci. 755 (1993) 355-371. | MR