Article contents
A deterministic rewrite system for the probabilistic λ-calculus
Published online by Cambridge University Press: 06 June 2019
Abstract
In this paper we present an operational semantics for the ‘call-by-name’ probabilistic λ-calculus, whose main feature is to use only deterministic relations and to have no constraint on the reduction strategy. The calculus enjoys similar properties to the usual λ-calculus. In particular we prove it to be confluent, and we prove a standardisation theorem.
Keywords
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 29 , Issue 10 , November 2019 , pp. 1479 - 1512
- Copyright
- © Cambridge University Press 2019
References
- 1
- Cited by