Innovate the way…
Find software, services, subscriptions, and specialists; evaluate deliveries, claim source, and learn in the Python-powered Lisp lab.
A little Jik, one idea at a time
The falling code is a small language tour. Choose an example, explore its result, then try it in Lisp Lab.
Reach Master in JIK to create and edit rain examples for other learners.
(define (+ a b) 999)
[(+ 20 22) (#+ 20 22)][999, 42]An ordinary name can be shadowed. A leading # looks in the native scope first, so #+ still adds these numbers.
In this runtime, #name falls back to the global scope when no native exists; it skips lexical bindings. The # is a lookup qualifier, not part of the symbol's name.
Try in Lisp Lab[#nil #f #t 42 3.5
(+ 0.1 0.2)
"hello" .name 'answer][(), #f, #t, 42, 3.5, 0.3, "hello", .name, answer]Nil, booleans, integers, decimals, strings, keywords and quoted symbols are values you can place in a vector.
The printer writes nil as () and decimals without a suffix: (+ 0.1 0.2) returns 0.3. A quote keeps answer as a symbol instead of looking up a binding.
Try in Lisp Lab((lambda [x] (#* x x))
(#+ 2 3))25A lambda receives evaluated arguments. Here addition produces 5 before the function squares x.
The parameter vector [x] names one argument. #([x] (#* x x)) is the compact form of this lambda.
Try in Lisp Lab((lambda [first : rest] [first rest])
10 20 30)[10, [20, 30]]A parameter after : receives all remaining arguments. first gets 10, while rest collects 20 and 30.
This website's runtime represents rest arguments as a vector. An empty rest sequence is [].
Try in Lisp Lab(define score 5)
(set! score (+ score 7))
score12define creates a binding; set! updates the existing cell.
declare-value reserves a value name; definitions and function names use separate cells.
Try in Lisp Lab(define x 10)
[(let [[x 2] [y x]] [x y])
(let* [[x 2] [y x]] [x y])][[2, 10], [2, 2]]let evaluates initializers in the outer scope. let* exposes each new binding to later initializers.
Try in Lisp Lab(letrec [[fact (lambda [n]
(if (= n 0) 1
(* n (funcall fact (- n 1)))) )]]
(funcall fact 5))120letrec creates the cells before filling them, so a closure can refer to its own binding.
Try in Lisp Lab(let count [[n 4] [total 0]]
(if (= n 0) total
(count (- n 1) (+ total n))))10Named let gives the local iteration a function name. A call in tail position reuses the VM invocation loop.
Try in Lisp Lab(define (classify value limit)
(cond [(< value limit) .below]
[(= value limit) .equal]
[else .above]))
(classify 8 10).belowCompare the same two arguments in every branch, and return the keyword selected by the public contract.
and and or short-circuit; nil and f are false, while other values are true.
Try in Lisp Lab(define answer 9)
(define (answer x) (+ x 3))
[answer (answer 6) (funcall @answer 7)][9, 9, 10]A symbol can have a value binding and a function binding. @answer retrieves the function as a value.
Try in Lisp LabMarketplace
3 simple editors in one with Lisp-like support
JIK language 525+
An unsolved, community-preordered project request for visual continuation tracing and exercises.
JIK language 315+
Network
JIK language designer and knowledge provider
JIK language, compiler, and VM author.
◉ English · ◉ Čeština
✎ English · ✎ Čeština
Repository
aegwenia/jik/native-global-lookup
Keep # outside symbol identity; resolve #name native first and then global, with @ selecting the function namespace.
aegwenia/jik/reader-literals
Read nil, booleans, integers, decimals, strings, characters, bytes, keywords, symbols, lists, vectors, and maps. Bare t/f are Boolean fallbacks only when ordinary bindings do not shadow them; #t/#f are explicit literals.
aegwenia/jik/definitions-bindings
Create value cells, update an existing cell, and distinguish declaration from definition.
aegwenia/jik/lexical-binding
Choose parallel, sequential, recursive, or loop-shaped lexical binding without exposing host state.
aegwenia/jik/conditions-logic
Branch and compose predicates while preserving the value of the selected form.
aegwenia/jik/functions-lambda
Create closures with fixed/rest parameters; parameters are lexical cells and rest arguments are bounded views.