Recently while reading up on the Squiggol [1,2] school of program algebra [3], I had a "Eureka" moment when I realized that the Joy combinator linrec was a...
... Something very similar occurred to me quite some time ago. The idea was to start with intrinsically useless copy algorithms for the various data types DT...
... [:] ... increase ... things. ... i had the identical reaction. it reads like a little detective story. bravo manfred!...
sa@...
Oct 6, 2005 3:22 pm
2719
Common lisp has a special operator labels used as the following: (defun recursive-times (k n) (labels ((temp (n) (if (zerop n) 0 (+ k (temp (1- n)))))) (temp...
... The == and scope control operators should serve nicely, and as a bonus will allow you to use your labels in other words. I admit that they're not as...
... Those three alternatives all have one thing in common: they all *appear* to copy all the data, without requiring any request on the part of the programmer....
On Mon, 17 Oct 2005, William Tanksley, Jr wrote: [..] ... Thank you. I was wrong in my assumption. ... I have not studied linear logic or linear Lisp in any...
After having come down with a case of the stack shuffling blues, I started exploring options for evaluating functions deeper inside the stack. The first thing...
(* Yahoo apparently ate my attachment. The code is below, or you can *) (* grab it at... http://sleepingsquirrel.org/almost/zipdip.joy *) DEFINE reverse ==...
... There is truly nothing new under the sun. Back in the original "Annoying Quadratic Formula" thread, Ivan Tomac and John Carter discuss pretty much this...
... Yep. Do you find it reduces the amount of stack shuffling you need? Greg Buchholz __________________________________ Yahoo! Mail - PC Magazine Editors'...
... I'm not sure that works, for two reasons. First, "better" is hard to measure in general; it's much easier to measure for specific purposes; but this means...
... I'd also recommend Baker's "'Use-Once' Variables and Linear Objects"... http://home.pipeline.com/~hbaker1/Use1Var.html ...and the Clean language, with its...
While doing some more thinking after my posting on gendip, I thought I'd also throw "combinator_lisp" out there for discussion. If a Joy program is a list of...
As long as I'm on a roll, here's one more attempt at cleaning up the quadratic formula. This procedure is related to a reader/state monad. We create an...
Here's one more improvement. Using strings to look up formal parameter values from an association list. This prevents the global namespace pollution present...
On Mon, 24 Oct 2005, Greg Buchholz wrote: [..] ... Trees can be representedd as lists possibly containing other lists possibly containing .. . The Joy stack is...
... Here's another possible example. In Joy-like lanugage, if you have a stack of [1,2,3] and you apply the "+" combinator, you get a new stack [1,5]. Now...
On Fri, 28 Oct 2005, Greg Buchholz wrote: [..] ... The +r operator would be easy to implement in current Joy, provided the original binary tree is implemented...
PREAMBLE For some years now I have been trying to understand monads in category theory and computing, with an embarrassing lack of any success. But recently ...
... Sorry to hijack your message, but I just wanted to bring up a point I realised at work today. I've often said that concatenative languages have their...
... OK. Not optimized at all, but here's my "obvious" stab at the problem. It stores the coefficients in a list and uses a few list munging helper functions....
