Sciweavers

180 search results - page 3 / 36
» Compiling Polymorphism Using Intensional Type Analysis
Sort
View
ICLP
2003
Springer
15 years 8 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
POPL
2004
ACM
16 years 3 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
TACS
1997
Springer
15 years 6 months ago
Type System for Specializing Polymorphism
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
Atsushi Ohori
APLAS
2000
ACM
15 years 7 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
ECOOP
2001
Springer
15 years 7 months ago
Precise Constraint-Based Type Inference for Java
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
Tiejun Wang, Scott F. Smith