Type Checking in System . . .

Cached

Download Links

by Christophe Raffalli

Active Bibliography

58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
12 Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable – J. B. Wells - 1993
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
An Optimized Complete Semi-Algorithm for System . . . – Christophe Raffalli, Universit De Savoie - 1999
1 System ST - Toward A Type System for Extraction AND Proof of Programs – Christophe Raffalli - 2001
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
103 On The Type Structure of Standard ML – Robert Harper, John C. Mitchell - 1993
1 ML Has Principal Typings – Carlos Camarão, Lucília Figueiredo - 2005
1 System ST, β-reduction and completeness – Christophe Raffalli, Université De Savoie - 2003
10 Raising ML to the Power of System F – Didier Le Botlan, Didier Remy - 2003
18 Extending ML with Semi-Explicit Higher-Order Polymorphism – Jacques Garrigue, Didier Remy - 1997
4 Rank 2 Types for Term Graph Rewriting (Extended Abstract) – Steffen van Bakel
Type soundness – François Pottier
9 Typability is undecidable for F+eta – J. B. Wells - 1995
Intersection, Universally Quantified, and Reference Types – Mariangiola Dezani-ciancaglini, Paola Giannini, Simona Ronchi, Della Rocca
26 Essential language support for generic programming – Jeremy Siek, Andrew Lumsdaine - 2005
26 Rank 2 Type Systems and Recursive Definitions – Trevor Jim - 1995
3 Type-Secure Meta-Programming – Christopher Bentley Dornan - 1998
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996