Incremental Polymorphic Type Checking With Update (1992)

Cached

Download Links

by Alan Mycroft
Citations:2 - 0 self

Active Bibliography

61 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
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
57 A Simplified Account of Polymorphic References – Robert Harper - 1994
2 Nominal Verification of Algorithm W – Christian Urban, Tobias Nipkow - 2008
4 Implicit Polymorphic Type System for the Blue Calculus – Silvano Dal-Zilio, Silvano Dal-zilio, Projet Meije - 1997
25 Type inference and semi-unification – Friedrich Henglein, Friedrich Henglein - 1988
135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
28 The complexity of type inference for higher-order typed lambda calculi – Fritz Henglein, Harry G. Mairson - 1991
Typed Constraint Logic Programs: checking domain coercions and metaprograms through subtyping – Emmanuel Coquery, François Fages
38 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
12 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
J. LOGIC PROGRAMMING 1994:19, 20:1–679 1 POLYMORPHIC TYPE ANALYSIS IN LOGIC PROGRAMS BY ABSTRACT INTERPRETATION 1 – Lunjin Lu
Checking Emptiness of Non-Deterministic Regular Types with Set Operators – Lunjin Lu
8 Type Analysis of Logic Programs in the Presence of Type Definitions – Lunjin Lu - 1995
6 Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog – Olivier Ridoux, Patrice Boizumault - 1999