Concatenative language invented by Robbert van Dalen. Its computational model is based on a purely functional Term Rewriting engine as opposed to the more conventional stack based model.
The ultimate research goal of Enchilada is: 'Information cannot be destroyed'. This is as far reaching in that even (unwritten) Terms are immutable in Enchilada.
To make this feasible, Enchilada is built on Persistent Data Structures, in particular Weight Balanced Binary Trees.
As of 20090705, work on Enchilada has stopped.
But the work has not been without a result. A new interesting data structure - The Purely Functional Canonical B-Tree - has been discovered while experimenting with Enchilada.
Homepage :
This revision created on Fri, 5 Feb 2016 02:40:01 by bengeorges (Rollback to 'Rollback to 'Rollback to 'Rollback to 'Rollback'''')