This might be relevant (apologies if not, I'm somewhat unsophisticated
and perhaps this is all old news, or not interesting.) :)
I was investigating G. Spencer-Brown's Laws of Form[1] by implementing it
in Python. You can represent the marks of LoF as datastructures in
Python composed entirely
On Mon, 25 Mar 2013, Chris Warburton wrote:
John Carlson yottz...@gmail.com writes:
So is anyone looking at binary parser generators? It would seem like
something like this would have been done ages ago.
Brings to mind Every Bit Counts. It's a library for serialising and
deserialising
On this issue:
* How does parallel processing fit into the picture?
the following may be useful:
In 1989 Henk Goeman combined Lambda Calculus with concepts from concurrency
directly, in his paper Towards a Theory of (Self) Applicative Communicating
Processes: a Short Note. The PDF is available
On 27 March 2013 09:58, Andre van Delft andre.vande...@gmail.com wrote:
In 1989 Henk Goeman combined Lambda Calculus with concepts from
concurrency directly, in his paper Towards a Theory of (Self) Applicative
Communicating Processes: a Short Note. The PDF is available at
Hi John and Andre,
On Mon, 25 Mar 2013, John Tromp wrote:
dear Andre/Jan,
PGA is very different from BLC of course, but both are a simple linear
notations. PGA starts with jump instructions, and it has step by step
extensions for variables, control structures, semaphores etc. It has been
Hi,
After reading John Tromp's paper [1] (also see De Bruijn Index [2]) I
got very interested in Binary Lambda Calculus (BLC). In my little spare
time I implemented a BLC interpreter in C [3, 4].
I thought it would be interesting to share it on this mailing list since
the motivation
Maybe this is not really what you are looking for, but would I recommend to
look at Program Algebra (PGA) [1,2,3,4, 5], by Jan Bergstra and others of
Amsterdam University, adjacent to Tromp's CWI. BTW Bergstra taught me lambda
calculus 32 years ago in Leiden, in a course Mathematical Logic.
Op 25 mrt. 2013, om 17:35 heeft John Tromp john.tr...@gmail.com het volgende
geschreven:
PGA is very different from BLC of course, but both are a simple linear
notations. PGA starts with jump instructions, and it has step by step
extensions for variables, control structures, semaphores etc.
So is anyone looking at binary parser generators? It would seem like
something like this would have been done ages ago.
On Mar 25, 2013 12:07 PM, Andre van Delft andre.vande...@gmail.com
wrote:
Op 25 mrt. 2013, om 17:35 heeft John Tromp john.tr...@gmail.com het
volgende geschreven:
PGA is
John Tromp john.tr...@gmail.com wrote to me:
dear Andre,
You may want to include my entire message, since my response to the fonc list
bounced (unsurprisingly, as I'm not a member), and was only seen by
you and Jan...
Apples and oranges look far more similar than PGA and BLC.
I would say
On 3/25/13, John Carlson yottz...@gmail.com wrote:
So is anyone looking at binary parser generators? It would seem like
something like this would have been done ages ago.
On Mar 25, 2013 12:07 PM, Andre van Delft andre.vande...@gmail.com
wrote:
Op 25 mrt. 2013, om 17:35 heeft John Tromp
John Carlson yottz...@gmail.com writes:
So is anyone looking at binary parser generators? It would seem like
something like this would have been done ages ago.
Brings to mind Every Bit Counts. It's a library for serialising and
deserialising datatypes by using each bit as a yes/no answer, eg.
Jan Wedekind j...@wedesoft.de writes:
Hi,
After reading John Tromp's paper [1] (also see De Bruijn Index [2])
I got very interested in Binary Lambda Calculus (BLC). In my little
spare time I implemented a BLC interpreter in C [3, 4].
I thought it would be interesting to share it on this
13 matches
Mail list logo
