ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic lambda calculus and subtyping
Theoretical Computer Science
A full continuous model of polymorphism
Theoretical Computer Science
βη-complete models for System F
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
A new model construction for the polymorphic lambda calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
| Hi-index | 0.00 |