DeepAI AI Chat

Upward confluence in the interaction calculus

06/19/2018

∙

by Anton Salikhmetov, et al.

∙

∙

The lambda calculus is not upward confluent, one of counterexamples being known thanks to Plotkin. This paper explores upward confluence in the interaction calculus. Can an interaction system have this property? We positively answer this question and even provide sufficient conditions for stronger one-step upward confluence.

page 1

page 2

page 3

page 4

∙ 07/07/2020

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinators

Here I report about the modifications of and relations between graphic l...

0 Marius Buliga, et al. ∙

∙ 01/16/2018

Refining Properties of Filter Models: Sensibility, Approximability and Reducibility

In this paper, we study the tedious link between the properties of sensi...

0 Flavien Breuvart, et al. ∙

∙ 08/20/2018

Lambda Calculus with Explicit Read-back

This paper introduces a new term rewriting system that is similar to the...

0 Anton Salikhmetov, et al. ∙

∙ 10/20/2017

An impure solution to the problem of matching fans

We present an algorithm to solve the problem of matching fans in interac...

0 Anton Salikhmetov, et al. ∙

∙ 11/13/2002

XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus

It has long been an open question whether the formula XCB = EpEEEpqErqr ...

0 Larry Wos, et al. ∙

∙ 02/05/2018

The Matrix Calculus You Need For Deep Learning

This paper is an attempt to explain all the matrix calculus you need in ...

0 Terence Parr, et al. ∙

∙ 05/29/2020

Malliavin calculus techniques for local asymptotic mixed normality and their application to degenerate diffusions

We study sufficient conditions for a local asymptotic mixed normality pr...

0 Fukasawa Masaaki, et al. ∙