my take on the idea of functional variant of false:
http://www.nsl.com/papers/ffalse.htm
the code is here:
http://www.nsl.com/k/ffalse.k
my version retains van oortmerssen's notational framework:
primitives are single symbols (there are 30 of them), names
are alpha. but my names are multicharacter.
also, my operators take conformable lists (e.g. [1 2 3][4 5 6]+
delivers [5 7 9].)
squeezing everything of value down onto thirty symbols called
for some hard decisions. i'm not sure i've got it right, but
some of the choices were interesting.
in the spirit of APL, i've tried to find mnemonic associations
for the new operators. some of them are found in the original
False (e.g. $ for *d*rop, % for *p*op.) others are new: ,
for append, so ; for cons, and of course ^ for uncons. since
! is unquote (joy's i), ? is dip. if and while combinators go
on } and {. reverse and left-shift on ) and (. # for count
and . for indexing. the quotation operator ' is syntactically
odd: 'x puts [x] on the stack for any x. and assignment is
also funny: 10 : a makes the variable a with value 10.
i've had the thought that one could force single-assignment
semantics by eliding the symbol for assignment. thus:
10 a
if a has no value, before evaluation, it gets 10. if it
has a value, it returns it. e.g.
[2 +] a
3 a !
5
either you see the point of this kind of game or you don't.
i've dropped the i/o, messaging, and comments. fFalse has no
side-effects other than assignment of names to values.
----- Original Message -----
From: <sa@...>
To: <concatenative@yahoogroups.com>
Sent: Friday, June 09, 2006 1:04 PM
Subject: [stack] Strictly False
>
>
> http://math.boisestate.edu/%7Eholmes/holmes/sfdocs.pdf
>
> an interesting concatenative language by set theorist Randall
> Holmes.
>
>
>
>
>
> Yahoo! Groups Links
>
>
>
>
>
>