A deterministic rewrite system for the probabilistic λ-calculus

E-resources

Peer reviewed

A deterministic rewrite system for the probabilistic λ-calculus

Leventis, Thomas

Mathematical structures in computer science, 11/2019, Volume: 29, Issue: 10

Journal Article

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.

Keep searching

Author

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme