Recent changes to Home

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:50:39 -0000

--- v13
+++ v14
@@ -4,7 +4,7 @@

 [Joy1](https://github.com/Leonidas-from-XIV/joy1 "")   A Joy1 distribution that works. 

-[Conca](https://sourceforge.net/projects/conca/ "") interpreter for a concatenative language, is comparable to Rabbit-vm.
+[Conca](https://sourceforge.net/projects/conca/ ""), interpreter for a concatenative language, is comparable to Rabbit-vm.

 ---------------------------

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:49:27 -0000

--- v12
+++ v13
@@ -2,9 +2,9 @@
 ======

-[Joy1](https://github.com/Leonidas-from-XIV/joy1 "A Joy1 distribution that works") 
+[Joy1](https://github.com/Leonidas-from-XIV/joy1 "")   A Joy1 distribution that works. 

-[Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.
+[Conca](https://sourceforge.net/projects/conca/ "") interpreter for a concatenative language, is comparable to Rabbit-vm.

 ---------------------------

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:47:37 -0000

--- v11
+++ v12
@@ -1,3 +1,7 @@
+Related Work
+======
+
+
 [Joy1](https://github.com/Leonidas-from-XIV/joy1 "A Joy1 distribution that works")

 [Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:46:14 -0000

--- v10
+++ v11
@@ -1,4 +1,4 @@
-[Joy1] (https://github.com/Leonidas-from-XIV/joy1 "A Joy1 distribution that works") 
+[Joy1](https://github.com/Leonidas-from-XIV/joy1 "A Joy1 distribution that works")

 [Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:45:53 -0000

--- v9
+++ v10
@@ -1,3 +1,4 @@
+[Joy1] (https://github.com/Leonidas-from-XIV/joy1 "A Joy1 distribution that works")

 [Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.

Home modified by sts-q

sts-q — Wed, 07 May 2014 19:43:05 -0000

--- v8
+++ v9
@@ -1,154 +1,3 @@
-Introducing the Rabbit-vm
-================
-
-
-Some time ago I made another attempt to learn stack-based, concatenative or tacit style of programming.
-Joy has no define-primitive. I would like to use () instead of [].
-Factor, with its 224MB-installation seems a lot more than i can chew.
-
-So the Rabbit-vm came into existence.
-
-I would like to introduce a few things i found on my way.
-
-
-
-a teaspoon of syntactic sugar
--------------------------------------
-
-
-() (1 2 3)  uncons (swons)dip
-() (1 2 3)  uncons swons^
-
-This ^ as a shortcut for ()dip is, IMHO of great help for writing, and mutch for reading code.
-Rabbit has up to ^^^^, only for words, not for quotations. I think that works out very well.
-
-
-(name)
-`name
-
-This is a small difference. The improvement is not in typing but in reading: `name is most of the time a name, passed to a function.
-
-
-(name)first
-,name
-
-This is sometimes helpful, sometimes a small pitfall:
-Construct a quotation that executes doc with name
-
-(1)    ,name (doc) cons i
-(2)    (name) first (doc) cons i
-(3)    name (doc) cons i
-(4)    (name doc) i
-(5)    name doc  ---> name is not defined.
-
-
-data == program == stack  / (1) define
-------------------------------------------------------
-
-A definition in Rabbit-vm is like this:
-
-(add) {a b  --  c  // add two numbers} (+) define
-
-a teaspoon of sugar:
-`add {a b --  c  // add two numbers} (+) define
-
-But i would like this:
-add: +
-
-Hmm??
-
-[
-add: {a b  --  c  // add two numbers} +
-sub: -
-mul: *
-] define-from-list
-
-With this as a start it evolved to:
-
-BEGIN
-
-add {a b --  c  /add two numbers}   +
-sub {}   -
-mul {} *
-
-END Letf.define
-
-
-
-data == program == stack  / (2) recurse
---------------------------------------------------------
-
-From time to time i run into a pattern like this:
-fac-2 doesn't work! Because copy+paste didn't change the name fac-1 into fac-2.
-
-fac-1: ( 0 = )( zap 1 )( dup 1 - fac-1 * )if*
-
-fac-2: dup 0 = ( zap 1 )( dup 1 - fac-1 * )if/
-
-
-In the following loop is just a symbol, that is going to be replaced by the name of the currently defined word. This saves typing and is an improvement on legibility.
-
-fac-1: ( 0 = )( zap 1 )( dup 1 - loop * )if*
-
-fac-2: dup 0 = ( zap 1 )( dup 1 - loop * )if/
-
-
-
-data == program == stack  / (3) tests
------------------------------------------------------
-
-`sample-tests {} BEGIN
-
-*:        3 4 TX                -> 12
-+:        3 4 TX   5 6 TX -> 7 11
-
-END define
-
-
-
-data == program == stack  / (4) the pattern
--------------------------------------------------------------
-
-(a) write down, what you would like to write
-(b) find a data-structure, you would like to work with
-(c) write function foo: (a) -> (b)
-
-
-
-
-
-stack and program-history or state-transition
--------------------------------------------------------------
-
-The stack is an arbitrary complex data structure. Well, most of the time it looks like a stack and is unused like a stack. The property arbitary-complex-data-structur includes arbitrary simple data structures like:
-
-stack == 1
-
-So, in order to liberate the stack from the burden of complexity and from the burden of state transition it is helpful to have an other data structure.
-
-This is what i call upstack, dmbarbour calls it a hand (i'm not sure if i know what he means.)
-I think it's just context.
-
-
-
-Rabbit-vm
--------------
-
-W o r l d                |       r a b b i t           -            v m
-                             |                                                              
-                                                                          hand/upstack/context (??? property-list)
-                                                                              |
-                                                                              |
-(     world of      )        ------ parse  --------->                
-(   char strings   )      <---- print   -----------            VM  <--->    definitions (hashtable)
-                                                                               |
-                                                                               |
-                                                                           stack
-                                                                       (linked list)
-
-
----------------------------
-

 [Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.

Home modified by sts-q

sts-q — Tue, 06 May 2014 20:54:07 -0000

--- v7
+++ v8
@@ -2,7 +2,7 @@
 ================

-Some time ago I made another attempt to lern stack-based, concatenative or tacit style of programming.
+Some time ago I made another attempt to learn stack-based, concatenative or tacit style of programming.
 Joy has no define-primitive. I would like to use () instead of [].
 Factor, with its 224MB-installation seems a lot more than i can chew.

@@ -42,10 +42,8 @@
 (5)    name doc  ---> name is not defined.

-data == programm == stack  / (1) define
+data == program == stack  / (1) define
 ------------------------------------------------------
-
-This is the mantra of Scheme and Joy.

 A definition in Rabbit-vm is like this:

@@ -77,7 +75,7 @@

-data == programm == stack  / (2) recurse
+data == program == stack  / (2) recurse
 --------------------------------------------------------

 From time to time i run into a pattern like this:
@@ -96,7 +94,7 @@

-data == programm == stack  / (3) tests
+data == program == stack  / (3) tests
 -----------------------------------------------------

 `sample-tests {} BEGIN
@@ -108,7 +106,7 @@

-data == programm == stack  / (4) the pattern
+data == program == stack  / (4) the pattern
 -------------------------------------------------------------

 (a) write down, what you would like to write
@@ -122,7 +120,7 @@
 stack and program-history or state-transition
 -------------------------------------------------------------

-The stack is an arbitrary complex data structur. Well, most of the time it looks like a stack and is unsed like a stack. The property  arbitary-complex-data-structur includes arbitrary simple data structures like:
+The stack is an arbitrary complex data structure. Well, most of the time it looks like a stack and is unused like a stack. The property arbitary-complex-data-structur includes arbitrary simple data structures like:

 stack == 1

@@ -149,27 +147,6 @@
                                                                        (linked list)

-Rabbit-vm does two things:
-
-   *  parse:  string of characters -->  items
-   *  execute as Joy does.
-
-
-
-So, this is what i can contrbute to the discussion.
-
-I think there a lots of running implemetations of pure Joy somewhere in the internet, but the only ones i know about are Joy1 in scheme and C form John Cowan, njoy in OCaml from  Christian Szegedy and Conca from Claude Marinier.
-
-The code is at sourceforge at Rabbit-vm. There is currently also a copy of this mail.
-
-Of course I would be happy about feedback.
-
-
-
-Best regards
-Heiko
-
-
 ---------------------------

Home modified by sts-q

sts-q — Fri, 02 May 2014 20:24:28 -0000

--- v6
+++ v7
@@ -173,7 +173,7 @@
 ---------------------------

-[Conca] is comparable to Rabbit-vm.
+[Conca](https://sourceforge.net/projects/conca/ "interpreter for a concatenative language") is comparable to Rabbit-vm.

 ---------------------------

Home modified by sts-q

sts-q — Fri, 02 May 2014 20:22:25 -0000

--- v5
+++ v6
@@ -170,14 +170,12 @@
 Heiko

+---------------------------

-Conca  is comparable to Rabbit-vm.
+
+[Conca] is comparable to Rabbit-vm.

 ---------------------------
-[SamplePage].
-
-The wiki uses [Markdown](/p/rabbitvm/wiki/markdown_syntax/) syntax.
-
 [[members limit=20]]
 [[download_button]]

Home modified by sts-q

sts-q — Fri, 02 May 2014 20:18:10 -0000

--- v4
+++ v5
@@ -170,6 +170,10 @@
 Heiko

+
+Conca  is comparable to Rabbit-vm.
+
+
 ---------------------------
 [SamplePage].