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

07/07/2020
by   Marius Buliga, et al.
0

Here I report about the modifications of and relations between graphic lambda calculus, various formalisms which appeared under the name chemlambda and a version of directed interaction combinators. This is part of the study and experiments with the artificial chemistry chemlambda and the relations with lambda calculus or interaction combinators, as described in arXiv:2003.14332 and available from the entry page at https://chemlambda.github.io/index.html

READ FULL TEXT
research
05/12/2020

Artificial life properties of directed interaction combinators vs. chemlambda

We provide a framework for experimentation at https://mbuliga.github.io/...
research
03/31/2020

Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

Given a graph rewrite system, a graph G is a quine graph if it has a non...
research
06/19/2018

Upward confluence in the interaction calculus

The lambda calculus is not upward confluent, one of counterexamples bein...
research
11/13/2022

Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus

We demonstrate that a modification of the classical index calculus algor...
research
06/01/2023

chemSKI with tokens: world building and economy in the SKI universe

chemSKI with tokens is a confluent graph rewrite system where all rewrit...
research
07/11/2023

On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation

We introduce the k-variable-occurrence fragment, which is the set of ter...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset