52 search results - page 2 / 11 » The Generalised Substitution Language Extended to Probabilis... |
FPCA
1995
13 years 9 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
ENTCS
2006
13 years 5 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
ENTCS
2007
13 years 5 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
ICFP
2003
ACM
13 years 11 months ago
2003
ACM
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
LANMR
2004
13 years 7 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...