References

  1. Samson Abramsky (1993): Computational Interpretations of Linear Logic. Theor. Comput. Sci. 111(1-2), doi:10.1016/0304-3975(93)90181-R.
  2. Amal Ahmed, Matthew Fluet & Greg Morrisett (2005): A Step-Indexed Model of Substructural State. In: Proc. 10th ACM SIGPLAN International Conference on Functional Programming (ICFP'05), doi:10.1145/1086365.1086376.
  3. Sandra Alves, Maribel Fernández, Mário Florido & Ian Mackie (2011): Linearity and Recursion in a Typed Lambda-calculus. In: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, PPDP '11. ACM, New York, NY, USA, pp. 173–182, doi:10.1145/2003476.2003500.
  4. Henry G. Baker (1994): A ``linear logic'' Quicksort. SIGPLAN Not. 29(2), pp. 13–18, doi:10.1145/181748.181750.
  5. Erik Barendsen & Sjaak Smetsers (1996): Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. In: Math. Struct. Comp. Sci..
  6. Gavin M. Bierman (1993): On Intuitionistic Linear Logic. University of Cambridge.
  7. Jawahar Chirimar, Carl A. Gunter & Jon G. Riecke (1996): Reference Counting as a Computational Interpretation of Linear Logic. Journal of Functional Programming 6, pp. 6–2, doi:10.1017/S0956796800001660.
  8. Luis Damas & Robin Milner (1982): Principal Type-Schemes for Functional Programs. In: Proc. 9th Annual ACM Symposium on Principles of Programming Languages (POPL'82), doi:10.1145/582153.582176.
  9. Edward Gan (2013): Clamp: Type Classes for Substructural Types. Senior Thesis. Harvard University. Available at http://edgan8.github.io/.
  10. Simon J. Gay & Vasco T. Vasconcelos (2010): Linear type theory for asynchronous session types. Journal of Functional Programming 20, pp. 19–50, doi:10.1017/S0956796809990268.
  11. Jean-Yves Girard (1972): Interprétation fonctionnelle et Elimination des coupures de l'arithmétique d'ordre supérieur. These d'état. Université de Paris 7, doi:10.1016/0304-3975(87)90045-4.
  12. Mark P. Jones (1995): Qualified Types: Theory and Practice. Cambridge University Press, New York.
  13. Mark P. Jones (1999): Typing Haskell in Haskell. In: Proc. 1999 Haskell Workshop.
  14. Karl Mazurak, Jianzhou Zhao & Steve Zdancewic (2010): Lightweight Linear Types in System F^. In: Proc. 5th ACM SIGPLAN Workshop on Types in Language Design and Implementation, doi:10.1145/1708016.1708027.
  15. Simon Peyton Jones & John Hughes, ed. (1999): Haskell 98: A Non-Strict, Purely Functional Language.
  16. Jesse A. Tov (2012): Practical Programming with Substructural Types. Northeastern University.
  17. Jesse A. Tov & Riccardo Pucella (2011): Practical Affine Types. In: Proc. 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'11), doi:10.1145/1926385.1926436.
  18. Edsko Vries, Rinus Plasmeijer & David M. Abrahamson (2008): Implementation and Application of Functional Languages, chapter Uniqueness Typing Simplified. Springer-Verlag, Berlin, Heidelberg, pp. 201–218, doi:10.1007/978-3-540-85373-2_12.
  19. Philip Wadler & Stephen Blott (1989): How to Make Ad-Hoc Polymorphism Less Ad Hoc. In: Proc. 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'89), doi:10.1145/75277.75283.
  20. David Walker (2005): Advanced Topics in Types and Programming Languages, chapter 1. MIT Press, Cambridge, Mass., U.S.A..
  21. Keith Wansbrough & Simon Peyton Jones (1999): Once upon a Polymorphic Type. In: Proc. 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'99). ACM, pp. 15–28, doi:10.1145/292540.292545.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org