References

  1. S. Abramsky (1993): Computational Interpretations of Linear Logic. Theo. Comp. Sci. 111(1-2), pp. 3–57, doi:10.1016/0304-3975(93)90181-R.
  2. K. Asai & Y. Kameyama (2007): Polymorphic Delimited Continuations. In: APLAS '07, LNCS 4807. Springer, pp. 239–254, doi:10.1007/978-3-540-76637-7_16.
  3. A. Avron (1991): Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4, pp. 225–248, doi:10.1007/BF01531058.
  4. A. Avron (2000): A Tableau System for Gödel–Dummett Logic Based on a Hypersequent Calculus. In: TABLEAUX '00, LNCS 1847. Springer, pp. 98–111, doi:10.1007/10722086_11.
  5. M. Baaz, A. Ciabattoni & C. G. Fermüller (2003): Hypersequent Calculi for Gödel Logics–a Survey. Journal of Logic and Computation 13(6), pp. 835–861, doi:10.1093/logcom/13.6.835.
  6. D. Baelde (2012): Least and Greatest Fixed Points in Linear Logic. ACM Trans. Comput. Logic 13(1), pp. 2:1–2:44, doi:10.1145/2071368.2071370.
  7. A. Bejleri & N. Yoshida (2009): Synchronous Multiparty Session Types. Electronic Notes in Theoretical Computer Science 241(0), pp. 3–33, doi:10.1016/j.entcs.2009.06.002.
  8. R. Blute & P. Scott (2004): Category Theory for Linear Logicians. Linear Logic in Computer Science 316, pp. 3–65, doi:10.1017/CBO9780511550850.002.
  9. L. Caires & F. Pfenning (2010): Session Types as Intuitionistic Linear Propositions. In: P. Gastin & F. Laroussinie: CONCUR 2010, LNCS 6269. Springer, pp. 222–236, doi:10.1007/978-3-642-15375-4_16.
  10. E. Casari (1989): Comparative Logics and Abelian l-groups. In: R. Ferro, C. Bonotto, S. Valentini & A. Zanardo: Logic Colloquium '88, Studies in logic and the foundations of mathematics 127. North-Holland, pp. 161–190, doi:10.1016/S0049-237X(08)70269-6.
  11. A. Ciabattoni, L. Straßburger & K. Terui (2009): Expanding the Realm of Systematic Proof Theory. In: CSL, pp. 163–178, doi:10.1007/978-3-642-04027-6_14.
  12. O. Danvy & A. Filinski (1990): Abstracting control. In: Proceedings of the 1990 ACM conference on LISP and functional programming, LFP '90. ACM, pp. 151–160, doi:10.1145/91556.91622.
  13. N. Galatos, P. Jipsen, T. Kowalski & H. Ono (2007): Residuated Lattices: An Algebraic Glimpse at Substructural Logics, 1st edition, Studies in Logic and The Foundations of Mathematics 151. Elsevier.
  14. M. Giunti & V. T. Vasconcelos (2010): A Linear Account of Session Types in the Pi Calculus. In: CONCUR 2010, LNCS. Springer, pp. 432–446, doi:10.1007/978-3-642-15375-4_30.
  15. Y. Hirai (2012): A Lambda Calculus for Gödel-Dummett Logic Capturing Waitfreedom. In: T. Schrijvers & P. Thiemann: Functional and Logic Programming, LNCS 7294. Springer, pp. 151–165, doi:10.1007/978-3-642-29822-6_14.
  16. Y. Hirai (2013): Hyper-Lambda Calculi. Univ. of Tokyo.
  17. K. Honda (1993): Types for Dyadic Interaction. In: CONCUR '93, LNCS 715. Springer, pp. 509–523, doi:10.1007/3-540-57208-2_35.
  18. K. Honda, N. Yoshida & M. Carbone (2008): Multiparty Asynchronous Session Types. In: POPL '08, POPL '08. ACM, pp. 273–284, doi:10.1145/1328438.1328472.
  19. K. Imai, S. Yuen & K. Agusa (2010): Session Type Inference in Haskell. In: PLACES, pp. 74–91, doi:10.4204/EPTCS.69.6.
  20. N. Kobayashi, B. C. Pierce & D. N. Turner (1999): Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), pp. 914–947, doi:10.1145/237721.237804.
  21. N. Kobayashi & A. Yonezawa (1995): Higher-Order Concurrent Linear Logic Programming. In: Theory and Practice of Parallel Programming, LNCS 907. Springer, pp. 137–166, doi:10.1007/BFb0026568.
  22. F. Lamarche (2008): Proof Nets for Intuitionistic Linear Logic: essential nets. Technical Report. Loria & INRIA-Lorraine.
  23. S. Marlow (2010): Haskell 2010 Language Report. Available online http://www.haskell.org/onlinereport/haskell2010.
  24. G. Metcalfe (2006): Proof Theory for Casari's Comparative Logics. Journal of Logic and Computation 16(4), pp. 405–422, doi:10.1093/logcom/exl001.
  25. G. Metcalfe, N. Olivetti & D. Gabbay (2002): Analytic Sequent Calculi for Abelian andŁ ukasiewicz Logics. In: U. Egly & C. Fermüller: TABLEAUX 2002, LNCS 2381. Springer, pp. 191–205, doi:10.1007/3-540-45616-3_14.
  26. R. K. Meyer & J. K. Slaney (1989): Abelian Logic (from A to Z). In: G. Priest, R. Richard & J. Norman: Paraconsistent Logic: Essays on the Inconsistent, chapter IX. Philosophia Verlag, pp. 245–288.
  27. R. Milner (1978): A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17(3), pp. 348–375, doi:10.1016/0022-0000(78)90014-4.
  28. R. Milner (1999): Communicating and Mobile Systems: the pi-calculus. Cambridge University Press.
  29. R. Milner, M. Tofte, R. Harper & D. MacQueen (1997): The definition of Standard ML. MIT press.
  30. A. S. Murawski & C. H. L. Ong (2003): Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit. Theoretical Computer Science 294(1-2), pp. 269–305, doi:10.1016/S0304-3975(01)00244-4.
  31. J. Rees & W. Clinger (1986): Revised Report on the Algorithmic Language Scheme. SIGPLAN Not. 21(12), pp. 37–79, doi:10.1145/15042.15043.
  32. M. Shirahata: A Sequent Calculus for Compact Closed Categories.
  33. K. Takeuchi, K. Honda & M. Kubo: An Interaction-Based Language and its Typing System. PARLE'94 Parallel Architectures and Languages Europe, pp. 398–413, doi:10.1007/3-540-58184-7_118.
  34. T. Toffoli (1980): Reversible Computing. In: J. Bakker & J. Leeuwen: Automata, Languages and Programming, LNCS 85. Springer, pp. 632–644, doi:10.1007/3-540-10003-2_104.
  35. P. Wadler (2012): Propositions as Sessions. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ICFP '12. ACM, pp. 273–286, doi:10.1145/2398856.2364568.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org