
Abductive functional programming, a semantic approach
We propose a callbyvalue lambda calculus extended with a new construct...
read it

The Geometry of Bayesian Programming
We give a geometry of interaction model for a typed lambdacalculus endo...
read it

Densities of almostsurely terminating probabilistic programs are differentiable almost everywhere
We study the differential properties of higherorder statistical probabi...
read it

Semantics of a Relational λCalculus (Extended Version)
We extend the λcalculus with constructs suitable for relational and fun...
read it

Denotational recurrence extraction for amortized analysis
A typical way of analyzing the time complexity of functional programs is...
read it

On Optimal Operational Sequence of Components in a Warm Standby System
We consider an open problem of optimal operational sequence for the 1ou...
read it

Discrete time stochastic and deterministic Petri box calculus
We propose an extension with deterministically timed multiactions of dis...
read it
Universal Semantics for the Stochastic LambdaCalculus
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higherorder probabilistic programs, but for the first time admit an adequacy theorem relating the operational and denotational views. This resolves the main issue left open in (Bacci et al. 2018).
READ FULL TEXT
Comments
There are no comments yet.