Sciweavers

283 search results - page 27 / 57
» Functional Pearls: Probabilistic functional programming in H...
Sort
View
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
15 years 7 months ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
POPL
2005
ACM
16 years 1 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
CIE
2010
Springer
14 years 12 months ago
Proofs, Programs, Processes
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Ulrich Berger, Monika Seisenberger
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 6 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
ICFP
2010
ACM
15 years 2 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones