CSE 645 (Fall 2011)
Seminar in Languages

General Information

Course description: We will read papers and discuss research ranging from high-level specifications (such as logic, rules, and sets) to algorithms and methods for efficient implementations, with applications in semantic web, security, and services.

Instructors: Michael Kifer, David Warren, and Annie Liu

Hours: Thursday 12:50-2:10PM, in CS 2313A.

Previous semesters: Spring 2011, Fall 2010, Spring 2010, Fall 2009, Spring 2009, Fall 2008, Spring 2008, earlier semesters.

Mailing list: http://lists.cs.stonybrook.edu/mailman/listinfo/languages

Topics

A special focus of this semester is type inference for dynamically typed languages. We will select papers from the following list (don't have to cover all) and possibly other interesting ones as they come up.
  1. Quantified Equilibrium Logic and the First Order Logic of Here-and-There. David Pearce and Agustn Valverde.
    http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7825
  2. ProFIT: Prolog with Features, Inheritance and Templates. Gregor Erbach.
    http://acl.ldc.upenn.edu/E/E95/E95-1025.pdf
  3. An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics. Chris Fox and Shalom Lappin. 2004.
    http://www.dcs.kcl.ac.uk/staff/lappin/papers/IGPL.pdf
  4. Well-Founded Semantics for Defeasible Logic. Frederick Maier and Donald Nute. 2011.
    http://www.springerlink.com/content/q27776400vk78375/
  5. Moving SWI and Yap gradually to Typed Prolog. Schrijvers, Santos Costa, Wielemaker, Demoen. 2008.
    http://people.cs.kuleuven.be/~tom.schrijvers/Research/papers/draft_ptypes_iclp08.pdf
    http://tomschrijvers.blogspot.com/2008/02/types-for-prolog.html
  6. Type Checking and Type Inferencing for Logic Programs with Subtypes and Parametric Polymorphism. Gregor Meyer. Technical report 1996.
    http://www.fernuni-hagen.de/wbs/typical/
  7. A polymorphic type system for PROLOG. Alan Mycroft and Richard A. O'Keefe. Artificial Intelligence Volume 23 Issue 3, August 1984.
    A Polymorphic type system for Prolog.pdf
    Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. Lakshman, TK and Reddy, US. Int. Logic Programming Symp, p 202-217, 1991.
    http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.62.6863&rep=rep1&type=pdf
  8. Polymorphically Typed Logic Programs. Eyal Yardeni, Thom Fruehwirth, and Ehud Shapiro. Types in Logic Programming, 1991.
    http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.58.1950&rep=rep1&type=pdf
    A type system for logic programs. Eyal Yardeni and Ehud Shapiro. The Journal of Logic Programming, Volume 10, Issue 2, Pages 125-153, February 1991. (Journal version that Puneet found)
    http://www.wisdom.weizmann.ac.il/~udi/papers/typesystemlogicprog_91.pdf
  9. Breaking through the n3 barrier: Faster object type inference. Henglein, F. TAPOS, v 5, n 1, p 57-72, 1999.
    http://www.diku.dk/hjemmesider/ansatte/henglein/papers/henglein1997.pdf
  10. Type inference with polymorphic recursion. Henglein, F. TOPLAS, v 15, n 2, p 253-289, 1993.
    http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.42.3091&rep=rep1&type=pdf
  11. A syntactic approach to type soundness. Wright, A.K. and Felleisen, M. Information and computation, v 115, n 1, p 38-94, 1994.
    http://cheetah.cs.virginia.edu/~weimer/2006-655/reading/wright92syntactic.pdf
  12. Precise concrete type inference for object-oriented languages. Plevyak, J. and Chien, A.A. ACM SIGPLAN Notices, v 29, n 10, p324-340, 1994.
    http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.75.6329&rep=rep1&type=pdf
  13. Lecture Notes on Polymorphic Type Inference. Michael I. Schwartzbach

Schedule

 9/1  Organizational meeting

 9/8 and 9/15 No class, but you may look at (paper 13)
      Lecture Notes on Polymorphic Type Inference

 9/22 Senlin (paper 5)
      Moving SWI and Yap gradually to Typed Prolo

 9/29 No class (per university calendar)

10/6  Bo (paper 12)
      Precise concrete type inference for object-oriented languages

10/13 Jon (paper 9)
      Breaking through the n3 barrier: Faster object type inference

10/20 Puneet (paper 8)
      Polymorphically Typed Logic Programs

10/27 Andre (paper 6)
      Type Checking and Type Inferencing for Logic Programs with Subtypes and Parametric Polymorphism

11/1  (This is a Tuesday, to accommodate the CEWIT conference on Thursday)

      David (paper 7)
      A polymorphic type system for PROLOG

11/10 Polina (paper 3)
      An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics

11/17 Reza (paper 2)
      ProFIT: Prolog with Features, Inheritance and Template

11/24 No class (Happy Thanksgiving!)

12/1  Paul (paper 1)
      Quantified Equilibrium Logic and the First Order Logic of Here-and-There

12/8  (Canceled)

      Spyros (paper 11)
      A syntactic approach to type soundness

Moved to Spring:

?/?   Aseem (paper 10)
      Type inference with polymorphic recursion

?/?   Michael (paper 4)
      Well-Founded Semantics for Defeasible Logic