Sciweavers

115 search results - page 10 / 23
» First-class Polymorphism with Type Inference
Sort
View
ICFP
2007
ACM
14 years 7 months ago
A type directed translation of MLF to system F
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
Daan Leijen
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 22 days ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
ICFP
2005
ACM
14 years 7 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
SAS
2007
Springer
125views Formal Methods» more  SAS 2007»
14 years 1 months ago
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
Introducing aspect orientation to a polymorphically typed functional language strengthens the importance of type-scoped advices; i.e., advices with their effects being harnessed b...
Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Kh...
CORR
2004
Springer
98views Education» more  CORR 2004»
13 years 7 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui