@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}, mrnumber = {1748664}, zbl = {0943.68014}, 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 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/ 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 %U http://www.numdam.org/item/ITA_1999__33_4-5_401_0/ %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, Tome 33 (1999) no. 4-5, pp. 401-426. http://www.numdam.org/item/ITA_1999__33_4-5_401_0/
[1] A relational theory of datatypes. Available via World-Wide Web at http://www.win.tue.nl/cs/wp/papers (September 1992).
, , , and ,[2] Non Well-Founded Sets, Number 14 in CSLI Lecture Notes. Center for the Study of Language and Information (Stanford, California, 1988). | MR | Zbl
,[3] A final coalgebra theorem, D.H. Pitt, Ed., Category Theory and Computer Science. Springer Verlag, Lecture Notes in Comput. Sci. (1989) 357-365. | MR
and ,[4] 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.
, , , , and ,[5] Generic functional programming with types and relations. J. Funct. Programming 6 (1996) 1-28. | MR | Zbl
, and ,[6] Algebra of Programming. Prentice-Hall International (1996). | Zbl
and ,[7] Reductivity arguments and program construction. Ph. D. Thesis, Eindhoven University of Technology, Department of Mathematics and Computing Science (1996). | MR | Zbl
,[8] Categories, Allegories. North-Holland (1990). | MR | Zbl
and ,[9] 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] A Generic Theory of Datatypes. Ph. D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1997). | MR | Zbl
,[11] 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
and ,[12] What is a datatype? Technical Report 96/16, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1996. J. Funct. Programming, to appear.
and ,[13] A tutorial on (co)algebras and (co)induction. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 62 (1997) 222-259. | Zbl
and ,[14] 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.
and ,[15] A semantics for shape. Sci. Comput Programming 25 (1995) 251-283. | MR | Zbl
,[16] 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
and ,[17] 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] 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.
and ,[19] A fixpoint theorem for complete categories. Math. Z. 103 (1968) 151-161. | MR | Zbl
,[20] Subequalizers. Canad. Math. Bull. 13 (1970) 337-349. | MR | Zbl
,[21] Categories for the Working Mathematician. Springer-Verlag, New York (1971). | MR | Zbl
,[22] 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] 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
, and ,[24] 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
and ,