KamilaLisp Two: Electric Boogaloo

A functional, flexible and concise Lisp inspired by Haskell and APL, among others. A ground-up rewrite.

Useful links:

• Read the book: An introduction to functional and array programming.

Setup

You need Java17 JDK or newer installed to build KamilaLisp yourself.

git clone https://github.com/kspalaiologos/kamilalisp
cd kamilalisp
mvn package

Alternatively, you could download a pre-compiled JAR file for use with Java 17 or newer:

export VERSION=0.3.0.1
mkdir kamilalisp && cd kamilalisp
# Download the KamilaLisp JAR
curl -L -O https://github.com/kspalaiologos/kamilalisp/releases/download/v$VERSION/kamilalisp-$VERSION.jar
# Verify the signature
curl -L -O https://github.com/kspalaiologos/kamilalisp/releases/download/v$VERSION/kamilalisp-$VERSION.jar.asc
curl https://palaiologos.rocks/pub.pgp | gpg --import # Or alternatively: gpg --recv-keys C868F0B6DE38409D
gpg --verify kamilalisp-$VERSION.jar.asc kamilalisp-$VERSION.jar

Features

KamilaLisp allows for actor programming, concurrent programming, imperative programming, functional programming, array programming, pure functional programming, object-oriented programming, rudimentary logic programming, mathematical programming, backend development, numerical and scientific computation, scripting and system administration, symbolic computation (real and complex analysis), tacit (point-free) programming, concurrent programming and event-driven programming. In more detail:

• Arbitrary precision complex, integer and decimal arithmetic.
• A fully-featured, remote IDE capable of communicating with KamilaLisp instances over the network. Supports multiple workspaces, contains an implementation of a hybrid tiling/floating window manager and editors.
• Many mathematical functions (bernoulli, gamma, trigonometry, arcus functions, hyperbolic functions, inverse hyperbolic functions, FFT, IFFT)
• Bit operations
• Number theoretic, combinatoric and linear algebraic functions (permutations, Levi-Civita, etc...)
• Functional higher order functions (fold, scan, all, none, some, converge, takewhile, dropwhile)
• Functional parallelism (parallel map and filter)
• Mu-recursive functions (SML projections, mu-recursive substitution operator).
• Prototype-based object orientation.
• No memory side effects, all collections are persistent.
• Possibilities of writing code in pure functional paradigm.
• Suffix array and Burrows-Wheeler transform construction.
• APL-style array processing (grade-up, grade-down, find, range, where, encode, decode, replicate, etc...).
• APL-style symbols for common operations.
• Set operations.
• Read/write support for JSON, CSV, XML, Base64, XZ, gzip, lz4, bzip2, tar and zip.
• Date and time manipulations.
• Integrated development environment - supports remote IDE sessions, compressed KamilaLisp code format, project management, multi-workspace and multi-session workflows, broadcasting/synchronising project data among multiple remote sessions.
• Persistent hashmaps, reactive hashmap literals.
• PNG, BMP, JPG and JPEG image I/O.
• File I/O (read, write, append).
• Basic matrix operations (LU decomposition, transpose, trace, matrix multiplication easily implemented as $(foldl + 0)%[1] \outer-product * A \matrix:transpose A.
• Performance benchmarks to measure GC time, average, median and standard deviation between runs of various expressions.
• Module system.
• Streams
• Process management (using sh:process) - manipulating input/output streams, etc...
• HTTP server - supports resource handlers, path handlers, complex routing, cookies, ...
• SQL database connection, auxiliary database drivers, statements, queries, prepared statements.
• Symbolic matrix LU decomposition, symbolic determinants.
• Pattern matching.
• Memoization.
• Imperative programming support.
• Networking (net:fetch, net:wget).
• Sockets (net:client, net:server and their SSL counterparts).
• Parallel processing using the actor model (daemon threads, task threads, message passing paradigm).
• Regular expressions.
• KamilaLisp as a shell (implementations of sh:ls, sh:glob, sh:mv, sh:basename, etc... - all usable from the REPL and from code, as they return plain data structures, launching and manipulating external processes).
• String functions (Shannon entropy, unicode handling, byte buffers, levenshtein distance, string interpolation/formatting)
• On-The-Fly Lexical scanner generation.
• Function compositions, partial application, variadic functions, static scoping.
• Tail call optimisation.
• Limits, complex limits.
• Indefinite integrals.
• Differentiation
• Polynomial factoring.
• Laurent, Taylor, MacLaurin and Puiseux series expansion.
• Functional de Bruijn indices.
• Possibility to write standalone non-interactive scripts.
• Symbolic matrix operations.
• Machine word operations (flt64:..., cmplx64:...) - Bessel functions, Hurwitz Zeta, Riemann Zeta, Upper/Lower Incomplete Gamma, Gamma, LogGamma, Pochhammer symbol, erf, erfc, Inverse erf, Inverse erfc, Digamma, Trigamma, Polygamma, Airy Ai, Bessel I, J, K and Y functions, Lerch Phi, Spence's function, Lambert W and Polylogarithm.
• Prompt styling.
• Portable.
• Graph data structure (e.g. directed, acyclic, weighted, etc...).
• Graph colouring (Saturation degree, greedy, largest degree first, smallest degree last, chordal, refinement, Brown backtrack).
• Graph clustering (Givman-Newman, k-Spanning tree, label propagation).

Examples

SKI calculus:

; SKI calculus
(defun SKI x
   (match x
      ((((S 'x) 'y) 'z) (tie (tie x z) (tie y z)))
      (((K 'x) 'y) x)
      ((I 'x) x)
      (('x 'y) (tie (SKI x) (SKI y)))
      ('x x)))

converge SKI '(((S I) I) K)

List operations and point-free programming:

; Take numbers from 0 to 9999, sum the resulting list and its reverse,
; then take the amount of unique items, and verify if it equals one.
= 1 \⍴∘⊙∘[+ #0 ⌽] \⍳ 10000

; In Haskell:
; (==1) . length . nub $ zipWith (+) <$> id <*> reverse $ [0..10000]

; In APL:
; 1=⍴∪(⊢+⌽)⍳10000

License

KamilaLisp is distributed under the GNU General Public License v3. See LICENSE for details.

Lisp Roadmap

• MalbolgeLISP v1.0-v1.2 - initial prototypes.
• KamilaLisp v0.1 (beta) - initial Java prototype, concept exploration.
• KamilaLisp v0.2 (beta) - design solidifying, API documentation.
• KamilaLisp v0.3 (release) - polishing more features, improved non-beta versioning scheme.
• KamilaLisp v0.4 (WIP) - a compiler and bytecode virtual machine.

v0.3 versioning guide

Every KamilaLisp v0.3 release will be signed with PGP and package maintainers are advised to verify the signature. Every release will be tagged as 0.3.x.y where a bump of x signifies a breaking change, while the bump of y signifies a non-breaking change.