Sciweavers

1003 search results - page 9 / 201
» Type Inference with Inequalities
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
ICFP
2008
ACM
14 years 7 months ago
HMF: simple type inference for first-class polymorphism
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...
Daan Leijen
IWPC
1999
IEEE
13 years 11 months ago
Understanding COBOL Systems using Inferred Types
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
Arie van Deursen, Leon Moonen
TGC
2007
Springer
14 years 1 months ago
On the Complexity of Termination Inference for Processes
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
APLAS
2004
ACM
14 years 28 days ago
Region-Based Memory Management for a Dynamically-Typed Language
Abstract. Region-based memory management scheme has been proposed for the programming language ML. In this scheme, a compiler statically estimates the lifetime of each object by pe...
Akihito Nagata, Naoki Kobayashi, Akinori Yonezawa