Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent Computer Mathematics

CICM 2009: Intelligent Computer Mathematics pp 170–185Cite as

A Groupoid of Isomorphic Data Transformations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5625))

Abstract

As a variation on the known theme of Gödel numberings, isomorphisms defining data type transformations in a strongly typed functional language are organized as a finite groupoid using a higher order combinator language that unifies popular data types as diverse as natural numbers, finite sequences, digraphs, hypergraphs and finite permutations with more exotic ones like hereditarily finite functions, sets and permutations.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lakoff, G., Johnson, M.: Metaphors We Live By. University of Chicago Press, Chicago (1980)

    Google Scholar 

  2. Cook, S.: Theories for complexity classes and their propositional translations. In: Complexity of computations and proofs, pp. 1–36 (2004)

    Google Scholar 

  3. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38, 173–198 (1931)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hartmanis, J., Baker, T.P.: On simple goedel numberings and translations. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 301–316. Springer, Heidelberg (1974)

    Chapter  Google Scholar 

  5. Mac Lane, S.: Categories for the Working Mathematician. Springer, New York (1998)

    MATH  Google Scholar 

  6. Pepis, J.: Ein verfahren der mathematischen logik. The Journal of Symbolic Logic 3(2), 61–76 (1938)

    Article  MATH  Google Scholar 

  7. Kalmar, L.: On the reduction of the decision problem. first paper. ackermann prefix, a single binary predicate. The Journal of Symbolic Logic 4(1), 1–9 (1939)

    Article  MathSciNet  MATH  Google Scholar 

  8. Robinson, J.: General recursive functions. Proceedings of the American Mathematical Society 1(6), 703–718 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  9. McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, part i. Commun. ACM 3(4), 184–195 (1960)

    Article  MATH  Google Scholar 

  10. Tarau, P.: Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell, 104 pages (January 2009) (unpublished draft), http://arXiv.org/abs/0808.2953

  11. Meijer, E., Hutton, G.: Bananas in Space: Extending Fold and Unfold to Exponential Types. In: FPCA, pp. 324–333 (1995)

    Google Scholar 

  12. Takahashi, M.O.: A Foundation of Finite Mathematics. Publ. Res. Inst. Math. Sci. 12(3), 577–708 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ackermann, W.F.: Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen (114), 305–315 (1937)

    Google Scholar 

  14. Knuth, D.E.: The art of computer programming, 3rd edn. seminumerical algorithms, vol. 2. Addison-Wesley/ Longman Publishing Co., Inc., Boston (1997)

    MATH  Google Scholar 

  15. Mantaci, R., Rakotondrajao, F.: A permutations representation that knows what ”eulerian” means. Discrete Mathematics & Theoretical Computer Science 4(2), 101–108 (2001)

    MathSciNet  MATH  Google Scholar 

  16. Alimarine, A., Smetsers, S., van Weelden, A., van Eekelen, M., Plasmeijer, R.: There and back again: arrows for invertible programming. In: Haskell 2005: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pp. 86–97. ACM Press, New York (2005)

    Chapter  Google Scholar 

  17. Conal Elliott: Data.Bijections Haskell Module, http://haskell.org/haskellwiki/TypeCompose

  18. Hughes, J.: Generalizing Monads to Arrows Science of Computer Programming 37, 67–111 (2000)

    Google Scholar 

  19. Martinez, C., Molinero, X.: Generic algorithms for the generation of combinatorial objects. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 572–581. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Knuth, D.: The Art of Computer Programming, vol. 4, draft (2006), http://www-cs-faculty.stanford.edu/~knuth/taocp.html

  21. Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters 79, 281–284 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  22. Cégielski, P., Richard, D.: Decidability of the theory of the natural integers with the cantor pairing function and the successor. Theor. Comput. Sci. 257(1-2), 51–77 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rosenberg, A.L.: Efficient pairing functions - and why you should care. International Journal of Foundations of Computer Science 14(1), 3–17 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kaye, R., Wong, T.L.: On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic Volume 48(4), 497–510 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kirby, L.: Addition and multiplication of sets. Math. Log. Q. 53(1), 52–65 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of North Texas, USA

    Paul Tarau

Authors
  1. Paul Tarau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    Jacques Carette

  2. Informatics, 2.02 Informatics Forum, University of Edinburgh, 10 Crichton street, EH8 9AB, Edinburgh, UK

    Lucas Dixon

  3. Department of Computer Science, University of Bologna, via Mura Anteo Zamboni, 7, 40127, Bologna, Italy

    Claudio Sacerdoti Coen

  4. Department of Computer Science MC 375, University of Western Ontario, N6A 5B7, London, ON, Canada

    Stephen M. Watt

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tarau, P. (2009). A Groupoid of Isomorphic Data Transformations. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds) Intelligent Computer Mathematics. CICM 2009. Lecture Notes in Computer Science(), vol 5625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02614-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02614-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02613-3

  • Online ISBN: 978-3-642-02614-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation