A deterministic rewrite system for the probabilistic λ-calculus

A deterministic rewrite system for the probabilistic λ-calculus

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 i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical structures in computer science 2019-11, Vol.29 (10), p.1479-1512
1. Verfasser: Leventis, Thomas
Format: Artikel
Sprache:eng
Schlagworte:
Calculus
Logic programming
Semantics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129519000045