... I'm sorry John, I realised only now that this question was probably addressed to me. I should have read your post more carefully. The situation is this: In...
Manfred von Thun
phimvt@...
Mar 14, 2002 10:30 am
1011
New things on the Joy page: plglib.joy propositional library (semantic tableaux) plgtst.joy test file plgtst.out output from the test file The...
Manfred von Thun
phimvt@...
Mar 14, 2002 10:59 am
1012
Manfred von Thun writes: [...] ... I think it is important that new Joy users have a clear distinction between "standard" libraries and examples or their own...
... So to summarize we want to provide two modes of operation: 1) The user types "joy" and gets an interpreter with the standard libraries loaded (all libs on...
Yet another language to add to the set.... http://www.cwi.nl/~tromp/cl/cl.html ...well not quite, it seems to be prefix'ish. I suspect he could drop all the...
From: "John Carter" <john.carter@...> ... It's worse than that -- it's applicative, and explicitly designed to be so. ... I suspect not; I think we'd...
... Yes, it is essentially Schoenfinkel's (1924) Combinatory Calculus, or lambda calculus minus lambda abstraction (if that isn't a contradiction). Joy is...
Manfred von Thun
phimvt@...
Mar 19, 2002 5:29 am
1018
A long time ago Billy and I discussed this topic bit in the TUNES archives March 2000 (see post Combinatory Completeness in Joy). The main result is that {dup,...
... I am most impressed - and embarassed because I had not noticed it before. What you have there makes what I have written on it rather simplistic....
Manfred von Thun
phimvt@...
Mar 20, 2002 5:37 am
1020
I just noticed something interesting a minute ago: that {cons, dip} alone (almost) gives linear completeness, because of the construction i == [[]] dip dip...
On -1 xxx -1, Brent L Kerby wrote: [... lots of good things about combinatory completeness for Joy ] ... I think that what you have here is far too important...
Manfred von Thun
phimvt@...
Mar 25, 2002 7:01 am
1022
... That sounds like a great idea. I think that sometime soon I'd be up to that. If Billy wants to write something up too, that'd be great, as two perspectives...
Inspired by the examples in "Imperative thinking for Joy programs" (http://www.latrobe.edu.au/www/philosophy/phimvt/joy/jp-imper.html) and wishing to get more...
Hi Nick, Interesting program! I tried creating my own version of it in Joy, though I'm not quite happy with the solution I got (but here it is anyway!). It is...
... Please do, please do. ... I look forward to seeing that. What language are you using for this brute ? ... Alternatively I could either 1) make the link...
Manfred von Thun
phimvt@...
Mar 28, 2002 1:15 am
1026
... C. It's coming along, and really is pretty close to being done. It's really not too big ... it's just that parts of it get really confusing and give me a ...
... I like the names 'dig' and 'bury' (and 'peek' and 'poke' too). Not having heard of names for these before I was calling them digN == shuN for "shift...
Hi Louis, Nice! I prefer your approach with the main loop(s). I tried a few variants on this theme but didn't know "from-to-list". The "mapr" combinator was...
Manfred, Could I make a small request for line comments in Joy? I for one would find them really useful for temporarily removing lines of code during ...
... and I noticed ... combinator ... and "poke", for ... Joy already has some of these operators (well... sort of). dig2 is called rolldown and bury2 is called...
... think ... within ... shouldn't, ... I couldn't get the program to work - Joy keeps complaining how it can't find the definition for pair. I did a grep on...
... pair was definitely in the earlier definitions of joy - the fact that it's not there now is a bug. Anyway, you can define it as: pair == unitlist cons; ...
... hoping ... pairlist. ... that ... The program still produces garbage - I'll have a look at why it's doing that a bit later. By the way pairlist is defined...
... Good point. And you're also right in pointing out that programs that use deep stack manipulation tools like these usually can be written in a simpler way ...
Hi Brent, Brent L Kerby writes: ... ... How does your searcher work? Does it begin by assuming a base of {cons, dip, i} and let you extend to include others...
... My old searcher had 9 built-in possible bases (including "dup", "swap", "cons", "dip", "i", ...); it used to be configurable by a small hard-wired change...
... My old searcher had 9 built-in possible bases (including "dup", "swap", "cons", "dip", "i", ...); it used to be configurable by a small hard-wired change...
