The probability of non-confluent systems

We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to transform a non-deterministic calculus into a probabilistic one. We use as example Lambda+, a recently introduced calculus defined through type isomorphisms.

[1]  Lionel Vaux.  The algebraic lambda calculus , 2009, Math. Struct. Comput. Sci..

[2]  ADOLFO PIPERNO,et al.  A FILTER MODEL FOR CONCURRENT -CALCULUS MARIANGIOLA DEZANI-CIANCAGLINI AND UGO DE'LIGUORO DIPARTIMENTO DI INFORMATICA UNIVERSIT , 1998 .

[3]  Jonghyun Park,et al.  Mechanizing Metatheory Without Typing Contexts , 2013, Journal of Automated Reasoning.

[4]  Gilles Dowek,et al.  Non determinism through type isomorphism , 2012, LSFA.

[5]  Mariangiola Dezani-Ciancaglini,et al.  A Filter Model for Concurrent lambda-Calculus , 1998, SIAM J. Comput..

[6]  Benoît Valiron,et al.  The Vectorial Lambda-Calculus , 2013, ArXiv.

[7]  Olivier Bournez,et al.  Rewriting Logic and Probabilities , 2003, RTA.

[8]  Normalisation of a Non-deterministic Type Isomorphic λ-calculus , 2013, ArXiv.

[9]  Ugo Dal Lago,et al.  Probabilistic operational semantics for the lambda calculus , 2011, RAIRO Theor. Informatics Appl..

[10]  Chris Hankin,et al.  Probabilistic λ-calculus and Quantitative Program Analysis , 2004 .

[11]  Giulio Manzonetto,et al.  Call-by-Value Non-determinism in a Linear Logic Type Discipline , 2013, LFCS.

[12]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[13]  Pablo Arrighi,et al.  A System F accounting for scalars , 2009, 0903.3741.

[14]  Catuscia Palamidessi,et al.  Probabilistic Asynchronous pi-Calculus , 2000, FoSSaCS.

[15]  Ugo de'Liguoro,et al.  Non deterministic extensions of untyped-calculus , 1995 .

[16]  Alejandro Díaz-Caro,et al.  Linearity in the Non-deterministic Call-by-Value Setting , 2012, WoLLIC.

[17]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[18]  Chris Hankin,et al.  Probabilistic /lambda-calculus and Quantitative Program Analysis , 2005, J. Log. Comput..

[19]  Gérard Boudol,et al.  Lambda-Calculi for (Strict) Parallel Functions , 1994, Inf. Comput..

[20]  Joost-Pieter Katoen,et al.  Formal Methods for Real-Time and Probabilistic Systems , 1999, Lecture Notes in Computer Science.

[21]  Alejandro D'iaz-Caro,et al.  Normalisation of a Non-deterministic Type Isomorphic {\lambda}-calculus , 2013, 1306.5089.

[22]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[23]  John J. Benedetto,et al.  Integration and Modern Analysis , 2009, Birkhäuser Avanced texts.

[24]  Alejandro D'iaz-Caro,et al.  A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus , 2010 .

[25]  Michele Pagani,et al.  Linearity, Non-determinism and Solvability , 2010, Fundam. Informaticae.

[26]  Antonio Bucciarelli,et al.  A relational semantics for parallelism and non-determinism in a functional setting , 2012, Ann. Pure Appl. Log..

[27]  Ugo de'Liguoro,et al.  Non Deterministic Extensions of Untyped Lambda-Calculus , 1995, Inf. Comput..

[28]  Herman Geuvers,et al.  Pure Type Systems without Explicit Contexts , 2010, LFMTP.

[29]  Catuscia PalamidessiDept.  Probabilistic Asynchronous -calculus ? , 2000 .

[30]  Pablo Arrighi.  Linear-algebraic λ-calculus: higher-order, encodings, and confluence , 2006 .