Sciweavers

429 search results - page 29 / 86
» Polymorphic typed defunctionalization
Sort
View
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
ICFP
2003
ACM
14 years 7 months ago
MLF: raising ML to the power of system F
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
Didier Le Botlan, Didier Rémy
CAV
2011
Springer
207views Hardware» more  CAV 2011»
12 years 11 months ago
Interactive Synthesis of Code Snippets
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...
Tihomir Gvero, Viktor Kuncak, Ruzica Piskac
APLAS
2005
ACM
14 years 1 months ago
Lightweight Family Polymorphism
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
Atsushi Igarashi, Chieri Saito, Mirko Viroli
POPL
1993
ACM
13 years 11 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...