References

  1. Antonio Bucciarelli & Thomas Ehrhard (2000): On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic. Ann. Pure Appl. Logic 102(3), pp. 247–282, doi:10.1016/S0168-0072(99)00040-8. Available at http://www.pps.univ-paris-diderot.fr/~buccia/PUBLI/apal00.ps.
  2. Antonio Bucciarelli & Thomas Ehrhard (2001): On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic 109(3), pp. 205–241, doi:10.1016/S0168-0072(00)00056-7. Available at http://www.pps.univ-paris-diderot.fr/~buccia/PUBLI/apal01.ps.
  3. Daniel de Carvalho (2009): Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. CoRR abs/0905.4251. Available at http://arxiv.org/abs/0905.4251.
  4. Thomas Ehrhard (2012): Collapsing non-idempotent intersection types. In: Patrick Cégielski & Arnaud Durand: CSL, LIPIcs 16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 259–273. Available at http://dx.doi.org/10.4230/LIPIcs.CSL.2012.259.
  5. Thomas Ehrhard (2012): The Scott model of linear logic is the extensional collapse of its relational model. Theor. Comput. Sci. 424, pp. 20–45, doi:10.1016/j.tcs.2011.11.027. Available at http://www.pps.univ-paris-diderot.fr/~ehrhard/pub/relscott.pdf.
  6. Charles Grellois & Paul-André Melliès (2015): Tensorial logic with colours and higher-order model checking. submitted, http://arxiv.org/abs/1501.04789.
  7. Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong & Olivier Serre (2008): Collapsible Pushdown Automata and Recursion Schemes. In: LICS. IEEE Computer Society, pp. 452–461, doi:10.1109/LICS.2008.34. Available at http://www.cs.ox.ac.uk/people/luke.ong/personal/publications/cpda-long.pdf.
  8. Naoki Kobayashi (2009): Types and higher-order recursion schemes for verification of higher-order programs. In: Zhong Shao & Benjamin C. Pierce: POPL. ACM, pp. 416–428, doi:10.1145/1480881.1480933. Available at http://www.kb.is.s.u-tokyo.ac.jp/~koba/papers/popl2009.pdf.
  9. Naoki Kobayashi & C.-H. Luke Ong (2009): A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. In: LICS. IEEE Computer Society, pp. 179–188, doi:10.1109/LICS.2009.29. Available at http://www.cs.ox.ac.uk/people/luke.ong/personal/publications/lics09-ko-long.pdf.
  10. C.-H. Luke Ong (2006): On Model-Checking Trees Generated by Higher-Order Recursion Schemes. In: LICS. IEEE Computer Society, pp. 81–90, doi:10.1109/LICS.2006.38. Available at http://www.cs.ox.ac.uk/people/luke.ong/personal/publications/ntrees.pdf.
  11. C.-H. Luke Ong & Takeshi Tsukada (2012): Two-Level Game Semantics, Intersection Types, and Recursion Schemes. In: Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts & Roger Wattenhofer: ICALP (2), Lecture Notes in Computer Science 7392. Springer, pp. 325–336, doi:10.1007/978-3-642-31585-5_31. Available at http://www.cs.ox.ac.uk/people/luke.ong/personal/publications/icalp12.pdf.
  12. Sylvain Salvati & Igor Walukiewicz (2012): Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. In: Alain Finkel, Jérôme Leroux & Igor Potapov: RP, Lecture Notes in Computer Science 7550. Springer, pp. 6–20, doi:10.1007/978-3-642-33512-9_2.
  13. Sylvain Salvati & Igor Walukiewicz (2013): Evaluation is MSOL-compatible. In: Anil Seth & Nisheeth K. Vishnoi: FSTTCS, LIPIcs 24. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 103–114, doi:10.4230/LIPIcs.FSTTCS.2013.103. Available at http://hal.inria.fr/docs/00/77/31/26/PDF/m.pdf.
  14. Sylvain Salvati & Igor Walukiewicz (2013): Using Models to Model-Check Recursive Schemes. In: Masahito Hasegawa: TLCA, Lecture Notes in Computer Science 7941. Springer, pp. 189–204, doi:10.1007/978-3-642-38946-7_15. Available at http://hal.archives-ouvertes.fr/docs/00/74/12/39/PDF/m.pdf.
  15. Kazushige Terui (2012): Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus. In: Ashish Tiwari: RTA, LIPIcs 15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 323–338, doi:10.4230/LIPIcs.RTA.2012.323. Available at http://www.kurims.kyoto-u.ac.jp/~terui/nbi8.pdf.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org