... [..] Nice problem. I immediately wrote a Joy program which would have run, but even before I got to type it in I recognised that it would have produced the...
... that's also the way i started thinking about it. here's the algorithm i settled on (with some help from a collection of combinatorial routines written in...
sa@...
Apr 4, 2005 1:37 pm
2424
Some interesting links. http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK4/NODE153.HTM Elegant program in Python: ...
Here's a problem to port to concatenative languages: parsing. I've seen many different solutions to this in various applicative languages: regular expressions,...
On Mon, 4 Apr 2005 18:17:29 -0400, "Ehrenberg Daniel" ... I played with porting a parser combinator library to Factor a while back. Here's the documentation...
... Nor are they unconcatenative, nor applicative -- they're programs, not source code. When you run the program, they take text as input, and produce a parse...
... Regular expressions are not concatenative, and monads and arrows are not concatenative, and parser generators are not concatenative. ... What I mean is...
... I didn't know until now, but I've actually been waiting 7 years (since my fundamentals of computation class) for someone to say that. :-) Regular...
Here's the updated code that gets rid of all the variables :) Maybe it is possible to rewrite every Haskell expression to not use variables afterall? ... ...
... It is -- I don't know whether you can do that without using monads, but you can do it with them. (Hint: a stack will work, in which case Haskell will...
... Change call-by-value into call-by-need ;-) ... In Joy, the following little snippet dies because of a division by zero error... 1 0 / "abc" swap pop ...but...
Before reading this, keep in mind I don't know what the hell I'm talking about. ... What I meant wasn't that regular expressions (as any rational person would...
... Thank you for the links -- very informative. It's not clear whether it's always possible to express code point-free in K and J, according to the discussion...
... An impressive list of credentials indeed -- worth at least as much as my computing theory class 7 years ago :-). ... Irregular grammars are extremely...
... any pure I already mentioned it was called point-free style in Haskell. ... point-free ... aware ... Haskell. ... Actually I would think Haskell has the...
... Facinating. Thanks for the voice of experience. ... Even if you do that, you're still stuck with a point-based style; see also my ab--baab shuffle notation...
... Of course it's impossible; in order to be able to write in a point-free style, you need some primitives. Haskell only provides the very pointed functional...
... Yeah, but most regular expression engines support irregular grammar, even if it's completely contradictory to the name. Because of their usefulness, I...
... [..] ... You said it well: recognition maps concatenation of regular expressions onto concatenation of languages. I say it without "recognition" but with...
a friend who had been doing some reading on combinatory logic asked me whether i knew how to write the Y-combinator in k. i didn't, but a little reading...
sa@...
Apr 7, 2005 9:22 pm
2449
... impossible ... the The problem with point-free style in Haskell is not that you need primitives, it's that even if you have a set of primitives like ...
... It sounds correct to me that S and K are complete, which means that using them you can construct all of the possible parameter reorderings you could ever...
