+

Continues from Birth and death of zipper combinators (I). In the following is presented another mechanism of birth/death of zipper combinators, which is not using a garbage collecting arrow and termination node. For any zipper combinator there is a number and a succession o f CLICK, ZIP and LOC PRUNING moves such that So this […]

+

Because zipper logic is a graph rewriting system which does not use variable names, just like GLC and chemlabda, it needs ways to multiply, distribute or kill things. See Chemlambda, universality and self-multiplication for multiplication, distribution or propagation phenomena. In this post we shall see how zipper combinators die or are born, depending on the sense […]

+

Inspired by the Zipper logic and knot diagrams post, here is an alternate encoding of chemlambda. This is part of the series on zipper logic (branded in this post as “zipperlogic”). The last post is Zipper logic (VI) latest version, detailed. As can be seen in that post, zipperlogic is equivalent with chemlambda, but it has […]

+

Here are all GLC local moves in one image, including the emergent algebra moves R1a, R1b, R2, ext2. Tagged: GLC, graphic lambda calculus, poster

+

… “full of sound and fury, signifying nothing.” And the editor believes it, even if it is self-contradictory, after sitting on the article for half a year. There are two problems: the problem of time; you write a long and dense article, which may be hard to review and the referee, instead of declining to […]