Sciweavers

283 search results - page 38 / 57
» Functional Pearls: Probabilistic functional programming in H...
Sort
View
ICFP
2008
ACM
16 years 1 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
15 years 7 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
FLOPS
2006
Springer
15 years 5 months ago
"Scrap Your Boilerplate" Reloaded
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
Ralf Hinze, Andres Löh, Bruno C. D. S. Olivei...
JMLR
2006
92views more  JMLR 2006»
15 years 1 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...
POPL
2004
ACM
16 years 1 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann