Thought experiment:
Which k primitives can be implemented as k-strings, reasonably efficiently, with a handful of 'native' built-ins?
Not verified to be in dependency order yet... may depend on the choice of 'fundamental' primitives. Need to do speed tests too.
k9 syntax (download via Shakti). Got a better way to write one? Feel free to comment, you'll be credited!
Portfolio Selection, Markowitz
Volatility Smile, Derman
Adaptive Markets, Lo
Python for Finance, Hilpisch
Advances in Financial ML, de Prado
Listed Vol & Variance Derivatives, Hilpisch
Artificial Intelligence in Finance, Hilpisch
Diary of a Professional Commodity Trader, Brandt
Market Timing with Moving Averages, Zakamulin
| const { evalString } = require("@borkdude/sci"); | |
| let printlnArgs = []; | |
| function println(...args) { | |
| printlnArgs.push(args.map(arg => arg.toString()).join(" ")); | |
| } | |
| exports.evalClojureExpr = (req, res) => { | |
| const { text } = req.body; |
Hello Friends,
This elf begging to climb onto the web for Christmas began as a personal email, a review of Paul Graham's little Lisp Bel. He sprouted arms, legs, and in gingerstyle ran away. Arms for symbols, legs for conses: these primitives are the mark a Lisp — even more so than the parenthesis. What do we get when we remove these foundation stones: naming and pairing?
No pairs. No cons. No structure. Unordered. Chaos. Eve, a beautifully incomplete aspect oriented triple store. No need for legs when you can effortlessly transport to your destination. Lazy. Pure. Here and now, a retrospective.
No symbols. No names. No variables. Combinators. Forth. No need for arms when you can effortlessly push and pop your stack. No words. A world without words. Virtual worlds. Virtual reality. Space. Time. Motion. Action. Kinetic Programming, a proposal.
I apologize in advance. Checking my pocketwatch, I see I haven't t
| // Inspired by http://kparc.com/b/c.h | |
| // See also https://chat.stackexchange.com/transcript/message/51402407#51402407 | |
| const x="x",y="y" | |
| // Function makers | |
| function fn() {return new Function(...arguments)} | |
| function f0(b) {return fn(b)} | |
| function f1(b) {return fn(x,b)} | |
| function f2(b) {return fn(x,y,b)} |
| # in /etc/systemd/system | |
| [Unit] | |
| Description=Bluetooth Agent | |
| [Service] | |
| ExecStart=/usr/bin/bt-agent -c NoInputNoOutput | |
| Type=simple | |
| [Install] | |
| WantedBy=multi-user.target |
| #include <time.h> // Robert Nystrom | |
| #include <stdio.h> // @munificentbob | |
| #include <stdlib.h> // for Ginny | |
| #define r return // 2008-2019 | |
| #define l(a, b, c, d) for (i y=a;y\ | |
| <b; y++) for (int x = c; x < d; x++) | |
| typedef int i;const i H=40;const i W | |
| =80;i m[40][80];i g(i x){r rand()%x; | |
| }void cave(i s){i w=g(10)+5;i h=g(6) | |
| +3;i t=g(W-w-2)+1;i u=g(H-h-2)+1;l(u |
Ctrl + Alt + Space
| {:deps {org.clojure/clojure {:mvn/version "1.10.0"} | |
| org.bouncycastle/bcprov-jdk15on {:mvn/version "1.61"}}} |
