|
524
|
From system F to typed assembly language
– Morrisett, Walker, et al.
- 1999
|
|
321
|
Subtyping recursive types
– Amadio, Cardelli
- 1993
|
|
232
|
TIL: A type-directed optimizing compiler for ML
– Tarditi, Morrisett, et al.
- 1996
|
|
94
|
Selective specialization for object-oriented languages
– Dean, Chambers, et al.
- 1995
|
|
92
|
A type system equivalent to flow analysis
– Palsberg, O'Keefe
- 1995
|
|
80
|
Selective and lightweight closure conversion
– Wand, Steckler
- 1994
|
|
73
|
A unified treatment of flow analysis in higher-order languages
– Jagannathan, Weeks
- 1995
|
|
60
|
A modular, polyvariant, and type-based closure analysis
– Banerjee
- 1997
|
|
56
|
Infinitary control flow analysis: A collecting semantics for closure analysis
– Nielson, Nielson
- 1997
|
|
56
|
From ML to Ada: Strongly-typed language interoperability via source translation
– Tolmach, Oliva
- 1998
|
|
53
|
Control-flow analysis and type systems
– Heintze
- 1995
|
|
53
|
Compiling Haskell by program transformation: A report from the trenches
– Jones
- 1996
|
|
48
|
Efficient recursive subtyping
– Kozen, Palsberg, et al.
- 1993
|
|
46
|
From polyvariant flow information to intersection and union types
– Palsberg, Pavlopoulou
- 2001
|
|
41
|
The Cartesian Product Algorithm
– Agesen
- 1995
|
|
33
|
Strongly typed flow-directed representation transformations
– Dimock, Muller, et al.
- 1997
|
|
33
|
Type directed cloning for object-oriented programs
– Plevyak, Chien
- 1995
|
|
32
|
Efficient recursive subtyping
– Kozen, Palsberg, et al.
- 1993
|
|
29
|
A typed intermediate language for flow-directed compilation
– Wells, Dimock, et al.
- 1997
|
|
25
|
Natural-semantics-based abstract interpretation
– Schmidt
- 1995
|
|
24
|
Flow-directed closure conversion for typed languages
– Cejtin, Jagannathan, et al.
- 2000
|
|
19
|
Type-directed flow analysis for typed intermediate languages
– Jagannathan, Weeks, et al.
- 1997
|
|
17
|
Systematic realisation of control flow analyses for CML
– Gasser, Nielson, et al.
- 1997
|
|
16
|
Polymorphic splitting: An effective polyvariant flow analysis
– Wright, Jagannathan
- 1998
|
|
14
|
Control flow analysis of higher order languages
– Shivers
- 1991
|
|
13
|
Higher-order uncurrying
– Hannan, Hicks
- 1998
|
|
12
|
Int'l Conf. Functional Programming
– Proc
- 1997
|
|
9
|
Flow logics and operational semantics
– Nielson, Nielson
- 1998
|
|
6
|
Functioning without closure: Type-safe customized function representations for Standard ML
– Dimock, Westmacott, et al.
- 2001
|
|
6
|
Combining closure conversion with closure analysis using algebraic types
– Tolmach
- 1997
|
|
5
|
Interprocedural control flow analysis
– Nielson, Nielson
- 1999
|
|
4
|
Polymorphic splitting: an e#ective polyvariant flow analysis
– Wright, Jagannathan
- 1998
|
|
1
|
Cheap eagerness: Speculative evaluation in a lazy language
– Faxén
- 1993
|
|
1
|
2nd Int'l Static Analysis Symp
– Proc
- 1995
|
|
1
|
2nd Int’l Static Analysis Symp., vol. 983 of LNCS
– Proc
- 1995
|
