Sciweavers

34 search results - page 1 / 7
» Efficient Strictness Analysis of Haskell
Sort
View
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
14 years 3 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
ENTCS
2007
100views more  ENTCS 2007»
13 years 11 months ago
Using Template Haskell for Abstract Interpretation
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Clara Segura, Carmen Torrano
PEPM
2010
ACM
14 years 7 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 3 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
PADL
2009
Springer
14 years 11 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan