Sciweavers

357 search results - page 15 / 72
» A type system for higher-order modules
Sort
View
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 2 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
POPL
2007
ACM
14 years 9 months ago
Modular type classes
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Derek Dreyer, Robert Harper, Manuel M. T. Chakrava...
LFP
1994
113views more  LFP 1994»
13 years 10 months ago
Collecting More Garbage
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
Pascal Fradet
ITP
2010
137views Mathematics» more  ITP 2010»
14 years 19 days ago
Importing HOL Light into Coq
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
Chantal Keller, Benjamin Werner
ICFP
2006
ACM
14 years 8 months ago
Recursive modules for programming
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
Keiko Nakata, Jacques Garrigue