Publications of Penn Database Group

Found 3 results

1987
Breazu-Tannen V, Meyer AR.  1987.  Polymorphism is conservative over simple types. Proceedings of 2nd IEEE Symposium on Logic in Computer Science. :7–17.
Breazu-Tannen V, Meyer AR.  1987.  Computable values can be classical. Proceedings of 14th Symposium on Principles of Programming Languages. :238–245.
1985
Breazu-Tannen V, Meyer AR.  1985.  Lambda calculus with constrained types (Extended abstract). LNCS 193: Proceedings of the Conference on Logics of Programs, Brooklyn, June 1985. :23–40.