Sciweavers

1313 search results - page 11 / 263
» Generic Universe Types
Sort
View
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
13 years 11 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
ICFP
2012
ACM
11 years 9 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
EACL
2009
ACL Anthology
14 years 7 months ago
Deriving Generalized Knowledge from Corpora Using WordNet Abstraction
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
Benjamin Van Durme, Phillip Michalak, Lenhart Schu...
ICFP
2010
ACM
13 years 7 months ago
The gentle art of levitation
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
James Chapman, Pierre-Évariste Dagand, Cono...