Quine graphs

Given a graph rewrite system. a graph G is a quine graph if it has a non-void maximal non-conflicting collection of rewrite patterns, such that after the rewrites from the collection are done in parallel we obtain a graph isomorphic with G.

We invite you to explore some of their properties, with examples taken from lambda calculus, interaction combinators and chemlambda.

Part of:

• Chemlambda projects page

Technical notes:

• Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

• Artificial life properties of directed interaction combinators vs. chemlambda

• Graph rewrites, from emergent algebras to chemlambda

Demos

• Interaction Combinators and chemlambda quine graphs

• How to test a quine

• The Ouroboros: from lambda terms to quine graphs

• Lambda calculus to chemlambda parser

• The quine lab

See also

• The collection of chemlambda animations salvaged from google+

More here

• Graphs figth arena (will turn into a tool to explore communities of quines): https://mbuliga.github.io/quinegraphs/arena.html

• Lambda terms reduced with chemlambda: https://mbuliga.github.io/quinegraphs/lambda.html