References

  1. F. Baader & J. H. Siekmann (1994): Unification theory. In: Dov M. Gabbay, Christopher J. Hogger, J. A. Robinson & Jörg H. Siekmann: Handbook of Logic in Artificial Intelligence and Logic Programming (2). Oxford University Press, pp. 41–126.
  2. I. G. Baltopoulos & A. D. Gordon (2009): Secure Compilation of a Multi-Tier Web Language. In: TLDI '09: Proceedings of the 4th international workshop on Types in language design and implementation. ACM, New York, NY, USA, pp. 27–38, doi:10.1145/1481861.1481866.
  3. J. Bengtson, K. Bhargavan, C. Fournet, A. D. Gordon & S. Maffeis (2008): Refinement Types for Secure Implementations. In: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium. IEEE Computer Society, Washington, DC, USA, pp. 17–32, doi:10.1109/CSF.2008.27. Available at http://portal.acm.org/citation.cfm?id=1380848.1381243.
  4. Ezra Cooper, Sam Lindley, Philip Wadler & Jeremy Yallop (2007): Links: Web Programming Without Tiers. In: Frank de Boer, Marcello Bonsangue, Susanne Graf & Willem-Paul de Roever: Formal Methods for Components and Objects, Lecture Notes in Computer Science 4709. Springer Berlin / Heidelberg, pp. 266–296, doi:10.1007/978-3-540-74792-5_12.
  5. P. Cousot (1997): Types as Abstract Interpretations, invited paper. In: Conference Record of the Twentyfourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, Paris, France, pp. 316–331, doi:10.1145/263699.263744.
  6. P. Cousot & R. Cousot (1977): Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, Los Angeles, California, pp. 238–252, doi:10.1145/512950.512973.
  7. P. Cousot & R. Cousot (1979): Systematic design of program analysis frameworks. In: Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, San Antonio, Texas, pp. 269–282, doi:10.1145/567752.567778.
  8. P. Cousot & R. Cousot (1992): Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming 13(2–3), pp. 103–179, doi:10.1016/0743-1066(92)90030-7.
  9. P. Cousot & R. Cousot (1992): Abstract Interpretation Frameworks. Journal of Logic and Computation 2(4), pp. 511–547, doi:10.1093/logcom/2.4.511.
  10. L. Damas & R. Milner (1982): Principal type-schemes for functional programs. In: POPL '82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, New York, NY, USA, pp. 207–212, doi:10.1145/582153.582176.
  11. L. Galletta (2010): Una semantica astratta per l'inferenza dei tipi ed effetti in un linguaggio multi-tier. Università di Pisa.
  12. D. K. Gifford & J. M. Lucassen (1986): Integrating functional and imperative programming. In: Proceedings of the 1986 ACM conference on LISP and functional programming, LFP '86. ACM, New York, NY, USA, pp. 28–38, doi:10.1145/319838.319848.
  13. R. Gori & G. Levi (2002): An Experiment in Type Inference and Verification by Abstract Interpretation. In: VMCAI '02: Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer-Verlag, London, UK, pp. 225–239, doi:10.1007/3-540-47813-2_16.
  14. C. A. Gunter & D. S. Scott (1990): Semantic Domains, chapter 12, pp. 634–674 Handbook of Theoretical Computer Science. Elsevier Science.
  15. R. Hindley (1969): The Principal Type-Scheme of an Object in Combinatory Logic. Transactions of the American Mathematical Society 146, pp. 29–60.
  16. INRIA: The Caml Language. Available at http://caml.inria.fr. WWW publication.
  17. J.-L. Lassez, M. J. Maher & K. Marriott (1988): Unification revisited. In: Foundations of deductive databases and logic programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 587–625.
  18. X. Leroy & F. Pessaux (2000): Type-based analysis of uncaught exceptions. ACM Trans. Program. Lang. Syst. 22, pp. 340–377, doi:10.1145/349214.349230.
  19. E. Meijer, W. Schulte & G. Bierman (2003): Programming with circles, triangles and rectangles. In: In XML Conference and Exposition.
  20. B. Monsuez (1992): Polymorphic Typing by Abstract Interpretation. In: Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag, London, UK, pp. 217–228, doi:10.1007/3-540-56287-7_107.
  21. F. Nielson & H. Nielson (1994): Constraints for polymorphic behaviours of concurrent ML. In: Jean-Pierre Jouannaud: Constraints in Computational Logics, Lecture Notes in Computer Science 845. Springer Berlin / Heidelberg, pp. 73–88, doi:10.1007/BFb0016845.
  22. F. Nielson, H. Riis Nielson & C. Hankin (2005): Principles of Program Analysis, 1st ed. 1999. corr. 2nd printing, 1999 edition. Springer.
  23. C. Queinnec (2000): The influence of browsers on evaluators or, continuations to program web servers. SIGPLAN Not. 35, pp. 23–33, doi:10.1145/357766.351243.
  24. D. Schmidt (1986): Denotational Semantics: A Methodology for Language Development. William C Brown Pub.
  25. J. Vouillon & P. Jouvelot (1995): Type and Effect Systems via Abstract Interpretation. Available at http://www.cri.ensmp.fr/classement/doc/A-273.pdf.
  26. G. Winskel (1993): The Formal Semantics of Programming Languages. MIT Press.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org