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!
container_end_page 1512
container_issue 10
container_start_page 1479
container_title Mathematical structures in computer science
container_volume 29
creator Leventis, Thomas
description 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.
doi_str_mv 10.1017/S0960129519000045
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2338536015</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2338536015</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-e58daa1fba4c1613cff9d63636352aa3154fb29cceda1627dab9721bead3a0c83</originalsourceid><addsrcrecordid>eNplkMFKxDAQhoMouK4-gLeA52gmadrm5rLoKix4UM9lkibYpd2uSYrss_kOPpMt9ebMYQ7_x_wzPyHXwG-BQ3H3ynXOQWgFmo-VqROygCzXrOSFOCWLSWaTfk4uYtxxDhK4XpD7Fa1dcqFr9k1MjaXBfYUmORqPMbmO-j7Q9OHoIfQGTdPO0M83s9jaoR3iJTnz2EZ39TeX5P3x4W39xLYvm-f1asvsaJqYU2WNCN5gZiEHab3XdS6nVgJRgsq8EdpaVyPkoqjR6EKAcVhL5LaUS3Iz7x0v-RxcTNWuH8J-tKyElKWS4_tqpGCmbOhjDM5Xh9B0GI4V8GoKqvoXlPwFh3FcJA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2338536015</pqid></control><display><type>article</type><title>A deterministic rewrite system for the probabilistic λ-calculus</title><source>Cambridge University Press Journals Complete</source><creator>Leventis, Thomas</creator><creatorcontrib>Leventis, Thomas</creatorcontrib><description>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.</description><identifier>ISSN: 0960-1295</identifier><identifier>EISSN: 1469-8072</identifier><identifier>DOI: 10.1017/S0960129519000045</identifier><language>eng</language><publisher>Cambridge: Cambridge University Press</publisher><subject>Calculus ; Logic programming ; Semantics</subject><ispartof>Mathematical structures in computer science, 2019-11, Vol.29 (10), p.1479-1512</ispartof><rights>Cambridge University Press 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c295t-e58daa1fba4c1613cff9d63636352aa3154fb29cceda1627dab9721bead3a0c83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Leventis, Thomas</creatorcontrib><title>A deterministic rewrite system for the probabilistic λ-calculus</title><title>Mathematical structures in computer science</title><description>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.</description><subject>Calculus</subject><subject>Logic programming</subject><subject>Semantics</subject><issn>0960-1295</issn><issn>1469-8072</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNplkMFKxDAQhoMouK4-gLeA52gmadrm5rLoKix4UM9lkibYpd2uSYrss_kOPpMt9ebMYQ7_x_wzPyHXwG-BQ3H3ynXOQWgFmo-VqROygCzXrOSFOCWLSWaTfk4uYtxxDhK4XpD7Fa1dcqFr9k1MjaXBfYUmORqPMbmO-j7Q9OHoIfQGTdPO0M83s9jaoR3iJTnz2EZ39TeX5P3x4W39xLYvm-f1asvsaJqYU2WNCN5gZiEHab3XdS6nVgJRgsq8EdpaVyPkoqjR6EKAcVhL5LaUS3Iz7x0v-RxcTNWuH8J-tKyElKWS4_tqpGCmbOhjDM5Xh9B0GI4V8GoKqvoXlPwFh3FcJA</recordid><startdate>20191101</startdate><enddate>20191101</enddate><creator>Leventis, Thomas</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20191101</creationdate><title>A deterministic rewrite system for the probabilistic λ-calculus</title><author>Leventis, Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-e58daa1fba4c1613cff9d63636352aa3154fb29cceda1627dab9721bead3a0c83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Calculus</topic><topic>Logic programming</topic><topic>Semantics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Leventis, Thomas</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Mathematical structures in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Leventis, Thomas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A deterministic rewrite system for the probabilistic λ-calculus</atitle><jtitle>Mathematical structures in computer science</jtitle><date>2019-11-01</date><risdate>2019</risdate><volume>29</volume><issue>10</issue><spage>1479</spage><epage>1512</epage><pages>1479-1512</pages><issn>0960-1295</issn><eissn>1469-8072</eissn><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.</abstract><cop>Cambridge</cop><pub>Cambridge University Press</pub><doi>10.1017/S0960129519000045</doi><tpages>34</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0960-1295
ispartof Mathematical structures in computer science, 2019-11, Vol.29 (10), p.1479-1512
issn 0960-1295
1469-8072
language eng
recordid cdi_proquest_journals_2338536015
source Cambridge University Press Journals Complete
subjects Calculus
Logic programming
Semantics
title A deterministic rewrite system for the probabilistic λ-calculus
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T04%3A01%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20deterministic%20rewrite%20system%20for%20the%20probabilistic%20%CE%BB-calculus&rft.jtitle=Mathematical%20structures%20in%20computer%20science&rft.au=Leventis,%20Thomas&rft.date=2019-11-01&rft.volume=29&rft.issue=10&rft.spage=1479&rft.epage=1512&rft.pages=1479-1512&rft.issn=0960-1295&rft.eissn=1469-8072&rft_id=info:doi/10.1017/S0960129519000045&rft_dat=%3Cproquest_cross%3E2338536015%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2338536015&rft_id=info:pmid/&rfr_iscdi=true