|
60
|
Smartest Recompilation
– Zhong Shao, Andrew W. Appel
- 1993
|
|
2
|
Principal Typing and Mutual Recursion
– Lucilia Figueiredo, Carlos Camarao, Carlos Camar~ao, Ouro Preto, Ouro Preto, Belo Horizonte
- 2001
|
|
56
|
A Simplified Account of Polymorphic References
– Robert Harper
- 1994
|
|
1
|
Nominal Verification of Algorithm W
– Christian Urban, Tobias Nipkow
- 2008
|
|
490
|
A Syntactic Approach to Type Soundness
– Andrew K. Wright, Matthias Felleisen
- 1992
|
|
4
|
Implicit Polymorphic Type System for the Blue Calculus
– Silvano Dal-Zilio, Silvano Dal-zilio, Projet Meije
- 1997
|
|
21
|
Polymorphic Type Inference and Semi-Unification
– Fritz Henglein
- 1989
|
|
129
|
Type Inference with Polymorphic Recursion
– Fritz Henglein
- 1991
|
|
|
Typed Constraint Logic Programs: checking domain coercions and metaprograms through subtyping
– Emmanuel Coquery, François Fages
|
|
35
|
Types as abstract interpretations, invited paper
– Patrick Cousot, École Normale Supérieure
- 1997
|
|
3
|
Rank 2 Intersection Types for Modules (Version with conclusions and appendices of [11])
– Ferruccio Damiani
|
|
7
|
Rank 2 Intersection Types for Modules
– Ferruccio Damiani
- 2003
|
|
11
|
Rank 2 Intersection Types for Local Definitions and Conditional Expressions
– Ferruccio Damiani
- 2003
|
|
|
M. H. Newman’s Typability Algorithm for Lambda-Calculus
– J. Roger Hindley
- 2006
|
|
6
|
Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog
– Olivier Ridoux, Patrice Boizumault
- 1999
|
|
6
|
Polymorphic Type Analysis in Logic Programs by Abstract Interpretation
– Lunjin Lu
- 1998
|
|
5
|
Type Analysis of Logic Programs in the Presence of Type Definitions
– Lunjin Lu
- 1995
|
|
|
Standard ML Weak Polymorphism Can Be Sound
– John Greiner May, John Greiner
- 1993
|
|
4
|
Debugging Type Errors
– Karen L. Bernstein, Eugene W. Stark
- 1995
|
