Sciweavers

87 search results - page 1 / 18
» Generic record combinators with static type checking
Sort
View
PPDP
2010
Springer
13 years 3 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
PLDI
2010
ACM
14 years 2 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
OOPSLA
1989
Springer
13 years 9 months ago
Static Type Inference for Parametric Classes
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
Atsushi Ohori, Peter Buneman
SIGMOD
1989
ACM
153views Database» more  SIGMOD 1989»
13 years 9 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
ECOOP
1999
Springer
13 years 9 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce