### 9 papers:

- LICS-2010-SilesH #similarity #type system
- Equality Is Typable in Semi-full Pure Type Systems (VS, HH), pp. 21–30.
- LICS-2006-TerauchiA #on the #polymorphism #recursion
- On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.
- FoSSaCS-1999-Benke #algebra #ml #type system
- An Algebraic Characterization of Typability in ML with Subtyping (MB), pp. 104–119.
- ICFP-1999-KfouryMTW #type system
- Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract) (AJK, HGM, FAT, JBW), pp. 90–101.
- CSL-1998-KhasidashviliP #normalisation
- Normalization of Typable Terms by Superdevelopments (ZK, AP), pp. 260–282.
- LICS-1994-Wells #decidability #higher-order #λ-calculus
- Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.
- TLCA-1993-Dowek #calculus
- The Undecidability of Typability in the λ-π-Calculus (GD), pp. 139–145.
- FPCA-1991-VolpanoS #complexity #ml #on the
- On the Complexity of ML Typability with Overloading (DMV, GS), pp. 15–28.
- POPL-1990-Mairson #exponential #ml
- Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.