The Generalised Substitution Language Extended to Probabilistic Programs

Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability that P holds in the current state'. Then add explicit numbers and arithmetic operators, to give a richer language of arithmetic formulae into which predicates are embedded by

• Type: Conference
• Year: 1998
• Where: B
• Authors: Carroll Morgan
• Keywords: Arithmetic Formulae, Arithmetic Operators, B 1998, Software Engineering, Substitution Language Gsl