Sciweavers

122 search results - page 5 / 25
» Polymorphic variants in Haskell
Sort
View
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
13 years 11 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...
ICFP
2005
ACM
14 years 7 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
BMCBI
2010
103views more  BMCBI 2010»
13 years 7 months ago
A method of predicting changes in human gene splicing induced by genetic variants in context of cis-acting elements
Background: Polymorphic variants and mutations disrupting canonical splicing isoforms are among the leading causes of human hereditary disorders. While there is a substantial evid...
Alexander G. Churbanov, Igor Vorechovsky, Chindo H...
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
14 years 1 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
TOOLS
2009
IEEE
14 years 2 months ago
Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
Christian Kästner, Sven Apel, Salvador Trujil...