Sciweavers

283 search results - page 14 / 57
» Functional Pearls: Probabilistic functional programming in H...
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 5 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
POPL
2009
ACM
16 years 2 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
MPC
2004
Springer
165views Mathematics» more  MPC 2004»
15 years 6 months ago
Prototyping Generic Programming in Template Haskell
Abstract. Generic Programming deals with the construction of programs that can be applied to many dierent datatypes. This is achieved by parameterizing the generic programs by the...
Ulf Norell, Patrik Jansson
POPL
2012
ACM
13 years 9 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 5 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...