133 search results - page 17 / 27 » Benchmarking Implementations of Lazy Functional Languages |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
PLDI
2010
ACM
14 years 23 days ago
2010
ACM
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
WFLP
2009
Springer
14 years 2 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...