Sciweavers

429 search results - page 13 / 86
» Polymorphic typed defunctionalization
Sort
View
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
SIGMOD
1989
ACM
153views Database» more  SIGMOD 1989»
13 years 11 months ago
Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
Atsushi Ohori, Peter Buneman, Val Tannen
LICS
2006
IEEE
14 years 1 months ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken
PODS
1999
ACM
89views Database» more  PODS 1999»
13 years 12 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
GI
2009
Springer
14 years 5 days ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...