References

  1. Andreas Abel & Jean-Philippe Bernardy (2020): A Unified View of Modalities in Type Systems. Proc. ACM Program. Lang. 4(ICFP), doi:10.1145/3408972.
  2. Nick Benton, Gavin Bierman, Valeria De Paiva & Martin Hyland (1992): Linear lambda-calculus and categorical models revisited. In: International Workshop on Computer Science Logic. Springer, pp. 61–84, doi:10.1007/3-540-56992-8_6.
  3. Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones & Arnaud Spiwack (2017): Linear Haskell: Practical Linearity in a Higher-Order Polymorphic Language. Proc. ACM Program. Lang. 2(POPL), doi:10.1145/3158093.
  4. Edwin Brady (2021): Idris 2: Quantitative Type Theory in Practice. In: Anders Møller & Manu Sridharan: 35th European Conference on Object-Oriented Programming (ECOOP 2021), Leibniz International Proceedings in Informatics (LIPIcs) 194. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 9:1–9:26, doi:10.4230/LIPIcs.ECOOP.2021.9. Available at https://drops.dagstuhl.de/opus/volltexte/2021/14052.
  5. Stephen Brookes & Kathryn V Stone (1993): Monads and Comonads in Intensional Semantics. Technical Report, Pittsburgh, PA, USA. Available at https://dl.acm.org/doi/10.5555/865105.
  6. Aloïs Brunel, Marco Gaboardi, Damiano Mazza & Steve Zdancewic (2014): A core quantitative coeffect calculus. In: European Symposium on Programming Languages and Systems. Springer, pp. 351–370, doi:10.1007/978-3-642-54833-8_19.
  7. Pritam Choudhury, Harley Eades III, Richard A. Eisenberg & Stephanie Weirich (2021): A Graded Dependent Type System with a Usage-Aware Semantics. Proc. ACM Program. Lang. 5(POPL), doi:10.1145/3434331.
  8. Richard A Eisenberg, Stephanie Weirich & Hamidhasan G Ahmed (2016): Visible type application. In: European Symposium on Programming. Springer, pp. 229–254, doi:10.1007/978-3-662-49498-1_10.
  9. Marco Gaboardi, Andreas Haeberlen, Justin Hsu, Arjun Narayan & Benjamin C Pierce (2013): Linear dependent types for differential privacy. In: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 357–370, doi:10.1145/2429069.2429113.
  10. Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Flavien Breuvart & Tarmo Uustalu (2016): Combining Effects and Coeffects via Grading. In: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016. Association for Computing Machinery, New York, NY, USA, pp. 476489, doi:10.1145/2951913.2951939.
  11. Dan R. Ghica & Alex I. Smith (2014): Bounded linear types in a resource semiring. In: Programming Languages and Systems. Springer, pp. 331–350, doi:10.1007/978-3-642-54833-8_18.
  12. Jean-Yves Girard (1987): Linear logic. Theoretical computer science 50(1), pp. 1–101, doi:10.1016/0304-3975(87)90045-4.
  13. Jean-Yves Girard, Andre Scedrov & Philip J Scott (1992): Bounded linear logic: a modular approach to polynomial-time computability. Theoretical computer science 97(1), pp. 1–66, doi:10.1016/0304-3975(92)90386-T.
  14. Ralf Hinze (2000): A new approach to generic functional programming. In: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 119–132, doi:10.1145/325694.325709.
  15. Jack Hughes, Daniel Marshall, James Wood & Dominic Orchard (2021): Linear Exponentials as Graded Modal Types. In: 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Rome (virtual), Italy. Available at https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271465.
  16. Jack Hughes & Dominic Orchard (2020): Resourceful Program Synthesis from Graded Linear Types. In: Logic-Based Program Synthesis and Transformation - 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7-9, 2020, Proceedings, pp. 151–170, doi:10.1007/978-3-030-68446-4_8.
  17. Jack Hughes, Michael Vollmer & Dominic Orchard (2021): Deriving Distributive Laws for Graded Linear Types (Additional Material), doi:10.5281/zenodo.5575771. Available at https://doi.org/10.5281/zenodo.5575771.
  18. C Barry Jay & J Robin B Cockett (1994): Shapely types and shape polymorphism. In: European Symposium on Programming. Springer, pp. 302–316, doi:10.1007/3-540-57880-3_20.
  19. Shin-ya Katsumata (2014): Parametric effect monads and semantics of effect systems. In: Suresh Jagannathan & Peter Sewell: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014. ACM, pp. 633–646, doi:10.1145/2535838.2535846.
  20. Shin-ya Katsumata (2018): A Double Category Theoretic Analysis of Graded Linear Exponential Comonads. In: Christel Baier & Ugo Dal Lago: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Lecture Notes in Computer Science 10803. Springer, pp. 110–127, doi:10.1007/978-3-319-89366-2_6.
  21. José Pedro Magalhães, Atze Dijkstra, Johan Jeuring & Andres Löh (2010): A Generic Deriving Mechanism for Haskell. SIGPLAN Not. 45(11), pp. 3748, doi:10.1145/2088456.1863529.
  22. Dominic Orchard, Vilem-Benjamin Liepelt & Harley Eades III (2019): Quantitative program reasoning with graded modal types. PACMPL 3(ICFP), pp. 110:1–110:30, doi:10.1145/3341714.
  23. Tomas Petricek, Dominic Orchard & Alan Mycroft (2014): Coeffects: a calculus of context-dependent computation. In: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming. ACM, pp. 123–135, doi:10.1145/2692915.2628160.
  24. Tomas Petricek, Dominic A. Orchard & Alan Mycroft (2013): Coeffects: Unified Static Analysis of Context-Dependence. In: Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska & David Peleg: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, Lecture Notes in Computer Science 7966. Springer, pp. 385–397, doi:10.1007/978-3-642-39212-2_35.
  25. John Power & Hiroshi Watanabe (2002): Combining a monad and a comonad. Theoretical Computer Science 280(1-2), pp. 137–162, doi:10.1016/S0304-3975(01)00024-X.
  26. Tim Sheard & Simon Peyton Jones (2002): Template Meta-Programming for Haskell. In: Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, Haskell '02. Association for Computing Machinery, New York, NY, USA, pp. 116, doi:10.1145/581690.581691.
  27. Ross Street (1972): The formal theory of monads. Journal of Pure and Applied Algebra 2(2), pp. 149–168, doi:10.1016/0022-4049(72)90019-9.
  28. K. Terui (2001): Light Affine Lambda Calculus and Polytime Strong Normalization. In: LICS '01. IEEE Computer Society, pp. 209–220, doi:10.1109/LICS.2001.932498.
  29. Tarmo Uustalu & Varmo Vene (November 2006): The Essence of Dataflow Programming. Lecture Notes in Computer Science 4164, pp. 135–167, doi:10.1007/11894100_5.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org