Mathematical models of computational and combinatorial structures

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 25-46

  Fiore, Marcelo P ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COMPUTER SCIENCE; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; MATHEMATICAL MODELS; SOFTWARE ENGINEERING;

COMBINATORIAL STRUCTURES; COMPUTATIONAL CALCULI; COMPUTATIONAL STRUCTURES; LAMBDA CALCULUS;

DATA STRUCTURES;

EID: 24644481586     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_2     Document Type: Conference Paper

References (53)

1. P. Aczel. Frege structures and the notions of proposition, truth and set. In The Kleene Symposium, pages 31-60. North-Holland, 1980.
2. J. Baez and J. Dolan. Higher-dimensional algebra III: n-categories and the algebra of opetopes. Advances in Mathematics, 135:145-206, 1998.
3. J. Baez and J. Dolan. From finite sets to Feynman diagrams. In B. Engquist and W.Schmid, editors, Mathematics Unlimited - 2001 and Beyond, pages 29-50. Springer-Verlag, 2001.
4. F. Bergeron. Une combinatoire du pléthysme. Journal of Combinatorial Theory (Series A), 46:291-305, 1987.
5. F. Bergeron, G. Labelle, and P. Leroux. Combinatorial species and tree-like structures, volume 67 of Encyclopedia of mathematics and its applications. Cambridge University Press, 1998.
6. R. Blute and P. Panangaden. Proof nets and Feynman diagrams. Available from the second author, 1998.
7. G. Cattani and G. Winskel. Profunctors, open maps and bisimulation. BRICS Report Series RS-04-22, University of Aarhus, 2004.
8. B. Day. On closed categories of functors. In Reports of the Midwest Category Seminar IV, volume 137 of Lecture Notes in Mathematics, pages 1-38. Springer-Verlag, 1970.
9. R. Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. Birkhauser, 1995.
10. T. Ehrhard and L. Regnier. The differential lambda calculus. Theoretical Computer Science, 309:1-41, 2003.
11. M. Fiore. Notes on combinatorial functors. Draft available electronically, January 2001.
12. M. Fiore. Rough notes on presheaves. Manuscript available electronically, July 2001.
13. th International Conference on Principles and Practice of Declarative Programming (PPDP 2002), pages 26-37. ACM Press, 2002.
14. st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2004), pages 77-88. ACM Press, 2004.
15. th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 147-156. IEEE, Computer Society Press, 2002.
16. M. Fiore and T. Leinster. An objective representation of the Gaussian integers. Journal of Symbolic Computation, 37(6):707-716, 2004.
17. M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the pi-calculus. Information and Computation, 178:1-42, 2002.
18. th Annual IEEE Symposium on Logic in Computer Science (LICS 96), pages 43-54, IEEE, Computer Society Press, 1996.).
19. th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 193-202. IEEE, Computer Society Press, 1999.
20. th Annual IEEE Symposium on Logic in Computer Science (LICS'01), pages 93-104. IEEE, Computer Society Press, 2001.
21. M. J. Gabbay and A. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
22. th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 214-224, IEEE, Computer Society Press, 1999.).
23. R. Geroch. Mathematical Physics. Chicago Lectures in Physics. The University of Chicago Press, 1985.
24. th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 204-213. IEEE, Computer Society Press, 1999.
25. G. Im and G. M. Kelly. A universal property of the convolution monoidal structure. Journal of Pure and Applied Algebra, 43:75-88, 1986.
26. P. Johnstone. Sketches of an Elephant: A Topos Theory Compendium, volume 43 of Oxford Logic Guides. Oxford University Press, 2002.
27. A. Joyal. Une theorie combinatoire des séries formelles. Advances in Mathematics, 42:1-82, 1981.
28. A. Joyal. Foncteurs analytiques et especès de structures. In Combinatoire énumérative, volume 1234 of Lecture Notes in Mathematics, pages 126-159. Springer-Verlag, 1986.
29. G. M. Kelly. Clubs and data-type constructors. In Applications of Categories in Computer Science, volume 177 of London Mathematical Society Lecture Notes Series, pages 163-190. Cambridge University Press, 1992.
30. F. W. Lawvere. Metric spaces, generalized logic and closed categories. Rend. del Sem. Mat. e Fis. di Milano, 43:135-166, 1973.
31. (Also in Reprints in Theory and Applications of Categories, 1:1-37, 2002.).
32. F. W. Lawvere. Qualitative distinctions between some toposes of generalized graphs. In Proceedings of the AMS 1987 Symposium on Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, pages 261-299, 1989.
33. F. W. Lawvere and R. Rosebrugh. Sets for Mathematics. Cambridge University Press, 2001.
34. S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971. (Revised edition 1998).
35. S. Mac Lane and I. Moerdijk. Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Universitext. Springer-Verlag, 1992.
36. M. Méndez. Species on digraphs. Advances in Mathematics, 123(2):243-275, 1996.
37. M. Méndez and O. Nava. Colored species, c-monoids and plethysm, I. Journal of Combinatorial Theory (Series A), 64:102-129, 1993.
38. M. Menni. About N-quantifiers. Applied Categorical Structures, 11(5):421-445, 2003.
39. M. Menni. Symmetric monoidal completions and the exponential principle among labeled combinatorial structures. Theory and Applications of Categories, 11:397-419, 2003.
40. R. Milner. What's in a name? In Computer Systems: Theory, Technology and Applications, Monographs in Computer Science. Springer-Verlag, 2003.
41. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1-77, 1992.
42. E. Moggi. An abstract view of programming languages. LFCS report ECS-LFCS-90-113, University of Edinburgh, 1990.
43. O. Nava and G.-C. Rota. Plethysm, categories and combinatorics. Advances in Mathematics, 58:61-88, 1985.
44. R. Needham. Distributed Systems, chapter 12, pages 315-328. Addison-Wesley, second edition, 1993.
45. F. Oles. Type algebras, functor categories and block structure. In Algebraic Methods in Semantics. Cambridge University Press, 1985.
46. F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN'88 Symposium on Language Design and Implementation, 1988.
47. D. Rajan. The adjoints to the derivative functor on species. Journal of combinatorial theory (Series A), 62:93-106, 1993.
48. J. Reynolds. The essence of Algol. In Proceedings of the International Symposium on Algorithmic Languages, pages 345-372. North-Holland, 1981.
49. I. Stark. Names and Higher-Order Functions. Ph.D. thesis, University of Cambridge, 1994.
50. th Annual IEEE Symposium on Logic in Computer Science (LICS'96), pages 36-42. IEEE, Computer Society Press, 1996.
51. R. Street. The role of Michael Batanin's monoidal globular categories. In Higher Category Theory, volume 230 of Contemporary Mathematics, pages 99-116. A.M.S., 1998.
52. th International Symposium on Mathematical Foundations of Computer Science (MFCS'00), volume 1893 of Lecture Notes in Computer Science, pages 670-679. Springer-Verlag, 2000.
53. S. Yong. A Framework for Binding Operators. Ph.D. thesis (LFCS report ECS-LFCS-92-207), University of Edinburgh, 1992.