Name
Abstract | ||
|---|---|---|
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically typed relatives support the straightforward expression via a rich numeric tower, existing statically typed languages force programmers to pollute textbook formulas with explicit coercions or unwieldy notation. In this paper, we demonstrate how the type system of Typed Racket accommodates both a textbook programming style and expressive static checking. The type system provides a hierarchy of numeric types that can be freely mixed as well as precise specifications of sign, representation, and range information--all while supporting generic operations. In addition, the type system provides information to the compiler so that it can perform standard numeric optimizations. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-27694-1_21 | PADL |
Keywords | Field | DocType |
range information,simple expression,standard numeric optimizations,numeric type,textbook formula,straightforward expression,expressive static checking,rich numeric tower,type system,static type checking | Type system,Notation,Programming language,Computer science,Lisp,Programming style,Compiler,Theoretical computer science,Strong and weak typing,Hierarchy,Racket | Conference |
Citations | PageRank | References |
8 | 0.57 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent St-Amour | 1 | 85 | 7.31 |
| Sam Tobin-Hochstadt | 2 | 391 | 24.82 |
| Matthew Flatt | 3 | 1030 | 85.48 |
| Matthias Felleisen | 4 | 3001 | 272.57 |