Front Page All Articles Recent Changes Random Article

Contents

Concatenative language

  • ACL
  • Ait
  • Aocla
  • Breeze
  • Cat
  • Cognate
  • colorForth
  • CoSy
  • Deque
  • Elymas
  • Enchilada
  • ETAC
  • F
  • 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

Elymas

Elymas, created by Drahflow, was built after he was missing APL features in C/C++ but was too lazy to create a parser for his new language.

The uppermost design assumption was: The programmer is right. And lazy.

Hence, many things which are invalid expressions in other languages do have a meaning in Elymas.

Notable features (general stack-based goodness omitted):

  • short and general stack reordering via [{ - }], e.g. [{ -021 }] will order a, b, c as c, a, b
  • creates stand-alone ELF binaries from closures
  • generalized APL like implicit loops for scalar functions (also works over dictionaries, trees and other functions)
  • self hosting via [{ { "/proc/self/fd/0" include }' "interpreter" sys .freeze }]
  • regex engine written in the language itself (and actually part of the [{include}] function)
  • coroutines

Homepage: https://github.com/Drahflow/Elymas

This revision created on Sun, 25 Jan 2015 22:26:00 by Drahflow (Initial entry)

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.