Front Page All Articles Recent Changes Random Article

Contents

Concatenative language

  • ACL
  • Ait
  • Breeze
  • Cat
  • Cognate
  • colorForth
  • CoSy
  • Deque
  • Elymas
  • Enchilada
  • ETAC
  • Factor
  • Forth
  • Freelang
  • Gershwin
  • Joy
  • Kitten
  • lang5
  • Lviv
  • min
  • mjoy
  • Mlatu
  • Ode
  • Om
  • Onyx
  • Plorth
  • Popr
  • Porth
  • PostScript
  • Quackery
  • r3
  • Raven
  • Retro
  • Staapl
  • Stabel
  • Trith
  • Worst
  • xs
  • XY
  • 5th
  • 8th

Other languages

  • APL
  • C++
  • Erlang
  • FP trivia
  • Haskell
  • Io
  • Java
  • JavaScript
  • Lisp
  • ML
  • Oberon
  • RPL
  • Self
  • Slate
  • Smalltalk

Computer Science

  • Type systems
  • Language paradigms
  • Compilers
  • Interpreters
  • Garbage collection

Meta

  • Search
  • Farkup wiki format
  • People
  • Etiquette
  • Sandbox

Enchilada

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.

For details, see http://www.enchiladacode.nl

This revision created on Fri, 28 Feb 2020 22:03:03 by mrjbq7

Latest Revisions Edit

All content is © 2008-2023 by its respective authors. By adding content to this wiki, you agree to release it under the BSD license.