Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Complete restrictions of the Intersection Type Discipline;van Bakel;Theoretical Computer Science,1992
2. Intersection Type Assignment Systems;van Bakel;Theoretical Computer Science,1995
3. Strongly Normalising Cut-Elimination with Strict Intersection Types;van Bakel;Electronic Notes in Theoretical Computer Science,2002
4. S van Bakel. Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalising. To appear in: Notre Dame Journal of Formal Logic, 2004
5. S van Bakel, S. Lengrand, and P. Lescanne. The language §: computation and sequent calculus in classical logic. Submitted, 2004