KamilaLisp: Difference between revisions
(quote about development) |
m (Text replacement - "Category:Programming languages" to "Category:List-based array languages") |
||
| Line 20: | Line 20: | ||
'''KamilaLisp''' is a Lisp dialect that includes APL-influenced array functionality and pre-defined glyphs, as well as other syntactic features designed to allow programming in an APL style. The language has built-in functionality intended for a broad range of use cases including mathematics. Array programming is done with immutable linked lists (other Lisps most often use mutable linked lists), which are one of several available data structures. There is also support for tacit or point-free programming, including a "fork" syntax, written with square brackets <code>[]</code>, that generalizes [[Train]]s to any number of arguments, and partial application somewhat similar to Haskell. | '''KamilaLisp''' is a Lisp dialect that includes APL-influenced array functionality and pre-defined glyphs, as well as other syntactic features designed to allow programming in an APL style. The language has built-in functionality intended for a broad range of use cases including mathematics. Array programming is done with immutable linked lists (other Lisps most often use mutable linked lists), which are one of several available data structures. There is also support for tacit or point-free programming, including a "fork" syntax, written with square brackets <code>[]</code>, that generalizes [[Train]]s to any number of arguments, and partial application somewhat similar to Haskell. | ||
{{APL dialects}}[[Category: | {{APL dialects}}[[Category:List-based array languages]][[Category:Languages with tacit programming]] | ||
Revision as of 22:46, 24 January 2024
|
KamilaLisp is a Lisp dialect that includes APL-influenced array functionality and pre-defined glyphs, as well as other syntactic features designed to allow programming in an APL style. The language has built-in functionality intended for a broad range of use cases including mathematics. Array programming is done with immutable linked lists (other Lisps most often use mutable linked lists), which are one of several available data structures. There is also support for tacit or point-free programming, including a "fork" syntax, written with square brackets [], that generalizes Trains to any number of arguments, and partial application somewhat similar to Haskell.
| APL dialects [edit] | |
|---|---|
| Maintained | APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ Dyalog APL Vision ∙ dzaima/APL ∙ GNU APL ∙ Kap ∙ NARS2000 ∙ Pometo ∙ TinyAPL |
| Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL2C ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Extended Dyalog APL ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ Operators and Functions ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
| Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ K (Goal, Klong, Q) ∙ KamilaLisp ∙ Lang5 ∙ Lil ∙ Nial ∙ RAD ∙ Uiua |
| Overviews | Comparison of APL dialects ∙ Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |