BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
type (4)
ml (3)
undecid (2)
calculus (2)
system (2)

Stem typabl$ (all stems)

9 papers:

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

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.