Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2012: Automata, Languages, and Programming pp 214–226Cite as

Discrete Generalised Polynomial Functors

(Extended Abstract)

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7392))

Abstract

We study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. The main theoretical contribution is the introduction of discrete generalised polynomial functors, a class that lies in between the classes of cocontinuous and finitary functors, and is closed under composition, sums, finite products, and differentiation. A variety of applications are given: to the theory of nominal algebraic effects; to the algebraic modelling of languages, and equational theories there of, with variable binding and polymorphism; and to the synthesis of dependent zippers.

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. Abbott, M., Altenkirch, T., Ghani, N.: Categories of Containers. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 23–38. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: Derivatives of Containers. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 16–30. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: ∂ is for data - differentiating data structures. Fundamenta Informaticae 65, 1–28 (2005)

    MathSciNet  MATH  Google Scholar 

  4. Altenkirch, T., Morris, P.: Indexed containers. In: LICS 2009, pp. 277–285 (2009)

    Google Scholar 

  5. Cattani, G.L., Winskel, G.: Profunctors, open maps, and bisimulation. Mathematical Structures in Computer Science 15, 553–614 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Crole, R.: Categories for Types. Cambridge University Press (1994)

    Google Scholar 

  7. Danvy, O., Dybjer, P. (eds.): Preliminary Proceedings of the APPSEM Workshop on Normalisation by Evaluation (1998)

    Google Scholar 

  8. Day, B.: On closed categories of functors. In: Reports of the Midwest Category Seminar IV. LNM, vol. 137, pp. 1–38. Springer (1970)

    Google Scholar 

  9. Fiore, M.: Semantic analysis of normalisation by evaluation for typed lambda calculus. In: PPDP 2002, pp. 26–37 (2002)

    Google Scholar 

  10. Fiore, M., Hur, C.-K.: On the construction of free algebras for equational systems. Theoretical Computer Science 410, 1704–1729 (2008)

    Article  MathSciNet  Google Scholar 

  11. Fiore, M., Hur, C.-K.: Second-Order Equational Logic (Extended Abstract). In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 320–335. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Fiore, M., Mahmoud, O.: Second-Order Algebraic Theories. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 368–380. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Fiore, M., Moggi, E., Sangiorgi, D.: A fully-abstract model for the pi-calculus. Information and Computation 179, 76–117 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fiore, M., Plotkin, G., Power, A.J.: Complete cuboidal sets in Axiomatic Domain Theory. In: LICS 1997, pp. 268–279 (1997)

    Google Scholar 

  15. Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: LICS 1999, pp. 193–202 (1999)

    Google Scholar 

  16. Fiore, M., Rosolini, G.: Domains in \(\boldmath\cal H\). Theoretical Computer Science 264, 171–193 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gambino, N., Hyland, M.: Wellfounded Trees and Dependent Polynomial Functors. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 210–225. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Gambino, N., Kock, J.: Polynomial functors and polynomial monads. ArXiv:0906:4931 (2010)

    Google Scholar 

  19. Girard, J.-Y.: Normal functors, power series and λ-calculus. Annals of Pure and Applied Logic 37, 129–177 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  20. Grothendieck, A.: Catégories fibrées et descente. In: SGA1. LNM, vol. 224. Springer (1971)

    Google Scholar 

  21. Hamana, M.: Polymorphic Abstract Syntax via Grothendieck Construction. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 381–395. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Hamana, M., Fiore, M.: A foundation for GADTs and Inductive Families: Dependent polynomial functor approach. In: WGP 2011, pp. 59–70 (2011)

    Google Scholar 

  23. Hofmann, M.: Syntax and semantics of dependent types. In: Semantics and Logics of Computation, pp. 79–130. Cambridge University Press (1997)

    Google Scholar 

  24. Huet, G.: The zipper. Journal of Functional Programming 7, 549–554 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  25. Jung, A., Tiuryn, J.: A New Characterization of Lambda Definability. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 245–257. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  26. Lawvere, F.W.: Adjointness in foundations. Dialectica 23 (1969)

    Google Scholar 

  27. Lawvere, F.W.: Metric spaces, generalized logic, and closed categories. Rend. del Sem. Mat. e Fis. di Milano 43, 135–166 (1973)

    Article  MathSciNet  Google Scholar 

  28. Lawvere, F.W.: Continuously variable sets: algebraic geometry = geometric logic. In: Proc. Logic Colloq. 1973, pp. 135–156 (1975)

    Google Scholar 

  29. Mac Lane, S.: Categories for the working mathematician. Springer (1971)

    Google Scholar 

  30. McBride, C.: The derivative of a regular type is its type of one-hole contexts (2001) (unpublished)

    Google Scholar 

  31. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55–92 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  32. Plotkin, G., Power, A.J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  33. Reynolds, J.: Using functor categories to generate intermediate code. In: POPL 1995, pp. 25–36 (1995)

    Google Scholar 

  34. Scott, D.: Relating theories of the λ-calculus. In: To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalisms. Academic Press (1980)

    Google Scholar 

  35. Stark, I.: Free-Algebra Models for the π-Calculus. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 155–169. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  36. Tambara, D.: On multiplicative transfer. Comm. Alg. 21, 1393–1420 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  37. Wagner, E.: Algebraic specifications: some old history and new thoughts. Nordic J. of Computing 9, 373–404 (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, University of Cambridge, UK

    Marcelo Fiore

Authors
  1. Marcelo Fiore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    Artur Czumaj

  2. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Kurt Mehlhorn

  3. Computer Laboratory,, University of Cambridge, UK

    Andrew Pitts

  4. ETH Zurich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiore, M. (2012). Discrete Generalised Polynomial Functors. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31585-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31584-8

  • Online ISBN: 978-3-642-31585-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation