Sciweavers

230 search results - page 31 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
DAC
2006
ACM
14 years 8 months ago
High-level power management of embedded systems with application-specific energy cost functions
Most existing dynamic voltage scaling (DVS) schemes for multiple tasks assume an energy cost function (energy consumption versus execution time) that is independent of the task ch...
Youngjin Cho, Naehyuck Chang, Chaitali Chakrabarti...
HASKELL
2006
ACM
14 years 1 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
ICLP
2005
Springer
14 years 1 months ago
Small Proof Witnesses for LF
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
Susmit Sarkar, Brigitte Pientka, Karl Crary
LICS
2007
IEEE
14 years 1 months ago
Relational Parametricity for Computational Effects
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
Rasmus Ejlers Møgelberg, Alex Simpson
POPL
2010
ACM
14 years 5 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...