Re: [fonc] quasiquoting in maru

2013-11-27 Thread Andre van Delft
Op 27 nov. 2013, om 07:25 heeft Faré het volgende geschreven: >> Faré wrote: >>> That's an area where indeed maru could improve on CL, by e.g. >>> specifying a meta-quasiquote protocol for how quoting interacts with >>> user-defined syntax. >> >> It might be worth looking at E's quasiliterals d

[fonc] Call for GSoC students on Scala & ACP related projects

2013-04-12 Thread Andre van Delft
The Scala team at EPFL Lausanne is this year again a mentoring organization for the Google Summer of Code, "a global program that offers students stipends to write code for open source projects". Following a presentation I gave there a month ago, the Scala team has included two projects for GSoC

Re: [fonc] Binary Lambda Calculus

2013-03-27 Thread Andre van Delft
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

Re: [fonc] Binary Lambda Calculus

2013-03-25 Thread Andre van Delft
John Tromp 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 it is more a

Re: [fonc] Binary Lambda Calculus

2013-03-25 Thread Andre van Delft
Op 25 mrt. 2013, om 17:35 heeft John Tromp 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. It has been >>

Re: [fonc] Binary Lambda Calculus

2013-03-25 Thread Andre van Delft
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. Fro

[fonc] SubScript website gone live: programming with Process Algebra

2013-01-01 Thread Andre van Delft
Please allow me to to blurb the following, which is related to several discussions at FONC: Our web site http://subscript-lang.org went officially live last Saturday. SubScript is a way to extend common programming languages, aimed to ease event handling and concurrency. Typical application are

Re: [fonc] Obviously Kogge-Stone

2012-12-04 Thread Andre van Delft
Lately I was wondering if we could design hardware inspired on Program Algebra (PGA) and Maurer Computers. PGA is an algebraic framework for sequential programming. PGA's creator Jan Bergstra writes in Why PGA?: > We have spotted Maurer's 1967 JACM paper on 'A theory of computer > instructions

Re: [fonc] The Web Will Die When OOP Dies

2012-06-15 Thread Andre van Delft
Fascinating. How did Iverson do division? Op 15 jun. 2012, om 23:08 heeft David Leibs het volgende geschreven: > Speaking of multiplication. Ken Iverson teaches us to do multiplication by > using a * outer product to build a times table for the digits involved. > +-++ > | | 3 6 6| > +

Re: [fonc] LightTable UI

2012-04-24 Thread Andre van Delft
FYI: at last week's Scala Days there was a talk about Asymmetric Lenses in Scala; these are unidirectional. http://skillsmatter.com/podcast/scala/asymmetric-lenses-scala Op 24 apr. 2012, om 18:48 heeft Toby Schachman het volgende geschreven: > Benjamin Pierce et al did some work on bidirectional

[fonc] Quiet and light weight devices

2012-04-21 Thread Andre van Delft
TechCrunch has an interview with Linus Torvalds. He uses a MacBook Air (iOS, BTW): [Start of Quote] I’m have to admit being a bit baffled by how nobody else seems to have done what Apple did with the Macbook Air – even several years after the first release, the other notebook vendors continue t

Re: [fonc] Scala Days 2012 and ACP

2012-04-20 Thread Andre van Delft
uld provide an > environment very much suited for experimenting with the ideas on this list. > > BR, > John > > Den 20 apr 2012 16:59 skrev "Andre van Delft" : > Indeed I missed the link to the video of the 12 year old Shadaj Laddad. > Here is it as yet: > h

Re: [fonc] Scala Days 2012 and ACP

2012-04-20 Thread Andre van Delft
hn Nilsson wrote: > I think one of the video links are wrong, should they both be the same? > BR, > John > Den 20 apr 2012 01:57 skrev "Andre van Delft" : > >> Scala Days 2012 was held this week in London; 400 passionate developers; >> many presentations

[fonc] Scala Days 2012 and ACP

2012-04-19 Thread Andre van Delft
Scala Days 2012 was held this week in London; 400 passionate developers; many presentations on DSLs, parallelism, concurrency, FP, compiler technology and much other stuff. http://days2012.scala-lang.org/ Enthusiastic tweets: https://twitter.com/search/scaladays The keynotes were by Guy Steele,

[fonc] Article "Lisp as the Maxwell’s equations of software"

2012-04-12 Thread Andre van Delft
FYI: Michael Nielsen wrote a large article "Lisp as the Maxwell’s equations of software", about the famous page 13 of the LISP 1.5 Programmer’s Manual; see http://www.michaelnielsen.org/ddi/lisp-as-the-maxwells-equations-of-software/ The article is discussed on Reddit: http://www.reddit.com/r/p

Re: [fonc] Naive question

2012-03-19 Thread Andre van Delft
Op 19 mrt. 2012, om 21:10 heeft Benoît Fleury het volgende geschreven: > I was wondering if there is any language out there that lets you describe the > behavior of an "object" as a grammar. > ... > If we assume an object receive a tick event to represent time, and using a > syntax similar to om

Re: [fonc] [IAEP] Barbarians at the gate! (Project Nell)

2012-03-15 Thread Andre van Delft
The theory Algebra of Communicating Processes (ACP) offers non-determinism (as in Meta II) plus concurrency. I will present a paper on extending Scala with ACP next month at Scala Days 2012. For an abstract, see http://days2012.scala-lang.org/node/92 A non-final version of the paper is at http:

Re: [fonc] One more year?!

2012-03-15 Thread Andre van Delft
I like this Process Algebra approach to music: http://www.cosc.brocku.ca/~bross/research/BrazilSCM95.pdf And here are some tracks: http://www.cosc.brocku.ca/~bross/research/LMJ/ Op 23 jan. 2012, om 06:17 heeft BGB het volgende geschreven: > On 1/22/2012 8:57 PM, Julian Leviston wrote: >> >> >

Re: [fonc] History of computing talks at SJSU

2011-12-15 Thread Andre van Delft
Op 15 dec. 2011, om 08:02 heeft Casey Ransberger het volgende geschreven: > Hypothesis: Mainstream software slows down at a rate slightly less than > mainstream > hardware speeds up. It's an almost-but-not-quite-inverse Moore's Law. > Unless someone else has called this out directly, I'm callin

[fonc] Fexpr the Ultimate Lambda

2011-11-27 Thread Andre van Delft
[My first post on the FONC mailing list had a wrong layout. Therefore I retry] This discussion mentions concurrency, the Meta II parser-compiler, Planner, and LINDA, which apply such concepts as non-determinism, parallelism and communication. These concepts are well described by the Algebra of

[fonc] Fexpr the Ultimate Lambda

2011-11-26 Thread Andre van Delft
This discussion mentions concurrency, the Meta II parser-compiler, Planner, and LINDA, which apply such concepts as non-determinism, parallelism and communication. These concepts are well described by the Algebra of Communicating Processes (ACP, also known as Process Algebra). This theory was i