Isomorphisms of generic recursive polynomial types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 77-88

  Fiore, Marcelo ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Data structure; Gr bner bases; Recursive types; Rigs; Semigroups; Type isomorphism; Type theory; Word problem

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DECISION MAKING; FORMAL LANGUAGES; MATHEMATICAL MODELS; POLYNOMIALS;

COMPUTATIONAL ALGEBRA; DATA TRANSFORMATIONS; TYPE ISOMORPHISM; TYPE THEORY;

COMPUTER SCIENCE;

EID: 2442430512     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964008     Document Type: Conference Paper

References (15)

1. th Annual Symposium on Logic in Computer Science, pages 242-252. IEEE, Computer Society Press, 1996.
2. R. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
3. A. Blass. Seven trees in one. Journal of Pure and Applied Algebra, 103:1-21, 1995.
4. R. Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. Birkhauser, 1995.
5. R. Di Cosmo, F. Pottier, and D. Rémy. Subtyping recursive types modulo associative commutative products. Preprint available on-line, 2003.
6. M. P. Fiore and T. Leinster. An objective representation of the Gaussian integers. To appear in the Journal of Symbolic Computation. (A preliminary preprint appeared in arXiv:math.RA/0211454, 2002).
7. M. P. Fiore and T. Leinster. Objects of categories as complex numbers. To appear in Advances in Mathematics. (A preliminary preprint appeared in arXiv:mach.CT/0212377, 2002).
8. R. Gates. On the generic solution to P(X) = X in distributive categories. Journal of Pure and Applied Algebra, 125:191-212, 1998.
9. th ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 276-289. ACM, 2001.
10. J. A. Green. On the structure of semigroups. Annals of Mathematics, 54:163-172, 1951.
11. G. Lallement. Semigroups and combinatorial applications. Wiley, 1979.
12. F. W. Lawvere. Private communication. Workshop on Domain Theory (DOMAIN 2002), Copenhagen, Denmark, July 2002.
13. th Annual Symposium on Logic in Computer Science, pages 388-398. IEEE, Computer Society Press, 2000.
14. B. Pierce. Types and Programming Languages. The MIT Press, 2002.
15. S. H. Schanuel. Negative sets have Euler characteristic and dimension. In Proc. Como 1990, volume 1488 of Lecture Notes in Mathematics, pages 379-385. Springer-Verlag, 1991.