Title
Practical Variable-Arity Polymorphism
Abstract
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scripting languages such as Scheme and Python. Statically typed languages also accommodate mod- est forms of variable-arity functions, but even ML and Haskell, languages with highly expressive type systems, cannot type check the wide variety of variable-arity functions found in untyped functional languages. Con- sequently, their standard libraries contain numerous copies of the same function denition with slightly dierent names. As part of the Typed Scheme project|an on-going eort to create an explicitly typed sister language for PLT Scheme|we have designed and implemented an expressive type system for variable-arity functions. Our practical validation in the context of our extensive code base conrms the usefulness of the enriched type system.
Year
DOI
Venue
2009
10.1007/978-3-642-00590-9_3
European Symposium on Programming
Keywords
Field
DocType
practical variable-arity polymorphism,uniform behavior,plt scheme,enriched type system,different name,distinct arities,distinct type,variable-arity function,typed scheme project,expressive type system,extensive code base,scripting language,type system,functional language,polymorphism
Type system,Programming language,First-class function,Typed lambda calculus,Computer science,Parametric polymorphism,Type inference,Theoretical computer science,Haskell,Strong and weak typing,Abstract type
Conference
Volume
ISSN
Citations 
5502
0302-9743
9
PageRank 
References 
Authors
0.62
7
3
Name
Order
Citations
PageRank
T. Stephen Strickland1815.35
Sam Tobin-Hochstadt239124.82
Matthias Felleisen33001272.57