I have my qualms with Janet. Mostly, it's lack of package management versioning and lack of libraries in general (advanced HTTP routing, etc).<p>I do LOVE that Janet can create binaries with JPM, scripts, and is very portable. I once put the Janet programming language on the Playdate game console as POC.<p>I actually do enjoy writing Janet, but every time I do people think I created the language (I did not).
Julia Evans has a fun blog post using Julia to visualize Gunzip: <a href="https://jvns.ca/blog/2013/10/24/day-16-gzip-plus-poetry-equals-awesome/" rel="nofollow">https://jvns.ca/blog/2013/10/24/day-16-gzip-plus-poetry-equa...</a><p>you should totally do a "Janet writes Janet" version
If you want server side, as veqq says there's joy which implements its own lightweight http server. If you want a client, it's quite trivial to use the Janet C API to wrap libcurl or any other HTTP client. If you're open to LLM development have the LLM write the wrappers and write your actual logic in Janet.
Have you tried jeep?<p><a href="https://github.com/pyrmont/jeep/" rel="nofollow">https://github.com/pyrmont/jeep/</a><p>It let's you vendor deps and easily install modern Janet bundles without jpm.
> advanced HTTP routing<p>What do you concretely mean by this? I use <a href="https://github.com/joy-framework/joy" rel="nofollow">https://github.com/joy-framework/joy</a> for all web stuff and can probably get your missing features in within the week.
There is also fennel, earlier language originally by same developer, that is similar, but compiles to, and is fully implemented in, Lua. No standard library of its own so missing many nice things like the parser library from janet, but it is good for writing scripts for things that embed Lua.<p><a href="https://fennel-lang.org/" rel="nofollow">https://fennel-lang.org/</a>
Fennel really is great, and a great way to get into the clojure family. My biggest gripe with it is that debugging is the typical transpilation bed of needles. The bridge between Fennel and the Lua VM is super fragile, and it just doesn't have half the quality of the Janet debugger and REPL. It's a real shame, because Fennel is way more portable, and thanks to LuaJIT is capable of breaking SBCL's jaw, which is absolutely fucking <i>insane</i>. But the transpilation experience just completely kneecaps it imo. There are workarounds you can do, but even if you mess around with implementing a debug.setinfo you still run into less-than-fun edge cases like with match-blocks.<p>I think there's a lot of value in forking LuaJIT2 and reworking the debugging and error structures within to make it more suitable for language transparency. Doing so would make languages like Fennel much more attractive.
Relevant issue #1457 VM instrumentation for third-party tools <a href="https://github.com/LuaJIT/LuaJIT/issues/1457" rel="nofollow">https://github.com/LuaJIT/LuaJIT/issues/1457</a> was opened by Mike Pall as recently as three weeks ago.<p>I gather that some features will be added to 2.1 but others only to 3.0.
> capable of breaking SBCL's jaw<p>What exactly do you mean by this? Speed? Portability? Ease of use?
What I mean by that is that it's in the same weightclass of speed, depending on the problem being tackled. In the case where data's shape is mutable, SBCL will scream ahead thanks to CLOS. You can cheat LuaJIT with dynamically-defined C-structures via abuse of the FFI lib instead of native tables, but it's not as nice as CLOS nor is it very safe. In the case that the shape of data is changed extremely frequently? CLOS might actually end up falling behind here. Another area where SBCL will likely win out is when the hotpath is bottlenecked on string operations.<p>Where I'd say it advances into breaking SBCL's jaw is that the runtime, interpreter, jitter, etc. are all much smaller than SBCL's runtime and compiler. If you're looking for a complete system, I'd say SBCL wins out obviously. You're talking a world-class REPL, debugger, a high quality stdlib, etc. All it's missing is a text editor like LispWorks (emacs and pretty much every other FOSS Lisp editor I've seen is a massive downgrade.) With that in mind, SBCL is not something you embed in an application written in another language. The holy grail is getting something as fast as SBCL, as flexible as SBCL, but as a 50k loc self-contained runtime. LuaJIT is the reigning heavyweight champ there, so having a Lisp-adjacent language like Fennel running atop it is a pretty damn compelling idea.<p>Interestingly with regards to text editors, Lua doesn't have that problem technically. Lite-XL is dangerously close to being zmacs/LispWorks for Lua. Poetically, just like Lua it's fairly bare bones and requires extension to be a decent IDE. But the underlying structure is absolutely fantastic, being based around a fairly cohesive object model rather than coats of paint over text buffers.
Is fennel clojure-ish? I’m vaguely aware of it being a lisp, but I didn’t know it was clojure-ey. Pretty neat sounding!
The author made these using Janet (discussed on HN in the past):<p><a href="https://bauble.studio" rel="nofollow">https://bauble.studio</a><p><a href="https://toodle.studio" rel="nofollow">https://toodle.studio</a><p>Those two fascinating art tools got me very excited about Janet a while back.
Always nice to see janet getting some attention.<p>shout out to one modern feature: sandbox<p>"Disable feature sets to prevent the interpreter from using certain system resources. Once a feature is disabled, there is no way to re-enable it."<p><a href="https://janet-lang.org/api/misc.html#sandbox" rel="nofollow">https://janet-lang.org/api/misc.html#sandbox</a>
> SETQ is def<p>At first I said "what" out loud, since SETQ doesn't create bindings, it only updates them then I read the doc (<a href="https://janet-lang.org/docs/bindings.html" rel="nofollow">https://janet-lang.org/docs/bindings.html</a>) and the author is indeed wrong ("bindings created with def are immutable"). He probably meant "SETQ is set".<p>I <i>really</i> want to like Janet, as it seems to be the sweet spot between Guile, Tcl and CL (minus the speed/maturity of SBCL) but I have a visceral reaction to square brackets (so vectors) being used in lambdas and control flow operators. Same as Clojure, I simply can't get over it. Maybe I will with enough effort?<p>Also, what's the current LSP/SLIME status? Really important these days.
Square brackets’ use is very consistent and rather logical in how they are used in Clojure’s syntax.<p>When round brackets are used, the first element in the list defines how the rest of the list is interpreted, for example:<p>(func a b c) — run a function with its parameters<p>(macro x y z) — expand a macro with its parameters<p>([p q r] …) — “bare” function body that starts with a vector of parameters, and executable forms follow.<p>Square brackets are used where elements are the same “kind”, and the first one is not special, e.g.:<p>(defn f [a b c] …) — a collection of same-kind parameters, the first parameter is not special<p>(let [a 1 b 2] …) — a collection of bindings, the first binding is not special<p>The only exception that comes to mind is grouping multiple matching elements in `case`, but it for ergonomics.<p>Once I got the logic, when which is used, I changed my mind, and ever since I’ve felt it’s beautiful.
> I have a visceral reaction to square brackets<p>Once you understand how destructuring works in Clojure, it then becomes obvious what role square-brackets play.
You can... just not use square (and curly) brackets. Instead of `[1 2 3]` just write `(array 1 2 3)`. Instead of `(fn [x] (+ 1 x))` just write `(f (x) (+ 1 x))`. They are never necessary.
janet has replaced sh, python, awk, etc. for me, for system scripts over a certain length! it has a very fast startup time (on my system, 1.4ms via hyperfine vs. 1ms for dash) for scripts (not compiled executables), and its sh-dsl module allows typing shell commands very elegantly, like ($ cmda w x | cmdb y z). the ability to load an image to debug is a big help, too. i've started using it very recently but it's probably one of my favorite languages now, and the only other lisp i've used is mit scheme for sicp.
This post is refreshing - smells of the pre AI discussions on the internet. A new language, a new syntax, heavy debate with people who have spent years writing code. I think someone should start a community online where AI isnt allowed.
> <i>I think someone should start a community online where AI isnt allowed.</i><p>In case you haven't followed the saga, the latest[1] digg.com relaunch failed because they couldn't deal with the bot onslaught [2]. Whoever finds a reliable way to keep AI out of an online community first is likely to become a very rich person.<p>[1] Second-to-last, actually, seeing as there seems to be a new homepage right now.<p>[2] <a href="https://www.techspot.com/news/111698-digg-relaunch-fails-two-months-ai-agents-spambots.html" rel="nofollow">https://www.techspot.com/news/111698-digg-relaunch-fails-two...</a>
I suspect real ways to keep AI out of a community, or really to have an online community at all, are going to be structurally incompatible with making anyone rich. The possibility of getting rich poisons the incentives.
> In case you haven't followed the saga, the latest[1] digg.com relaunch failed because they couldn't deal with the bot onslaught [2]<p>Given that they wrote their goodbye post using LLMs and gave up after such a short amount of time, I don't take that at face value the same way I don't believe AI layoffs
We've already got models that can handle it - eg web of trust. We don't want to use them.<p>Plus "AI" is a spectrum, with "the AI fixed a typo for me" at one end, and "the AI writes my posts for me" at the other.
> Whoever finds a reliable way to keep AI out of an online community first is likely to become a very rich person.<p>I believe it’s the opposite: You have to pay competent human moderators. Like here on HN.
Perhaps requiring webauthn credential for any post/comment with a whitelist of permitted webauthn hardware devices which must have touch/interaction enabled.<p>I'd have to read the FIDO specs, however the only place I've seen webauthn hardware pinning in the wild is with Azure AD/Entra which is ostensibly based on token GUID. If this is the only enforcement mechanism available, it's spoofable.
Then you’ll end up with a forum of only bots because they’ll spoof it and real people won’t put up with the hassle.
FIDO tokens are designed to able (if authorized by the software, your web browser typically offers a pop-up where you can decline this) to prove their membership of a batch of tokens, but not their individual identity.<p>The Entra feature you thinking of lets somebody say "Only things which can prove they're in this list work". This <i>could</i> make sense if you, as their employer, issue every employee a custom DoodadCorp Doodad FIDO key and so you don't want somebody's Yubikey or off-brand generic device to work. It's <i>stupid</i> and you shouldn't do it in other scenarios, but your "this is how we detect humans" idea is arguably a scenario where that could make sense.<p>[Edited to add: This feature is called "Attestation"]
Doesn't actually work that well. Browsers hate this, the hardware isn't actually difficult for bots to access, and privacy story is bad. There are solutions being worked on.
This would result in hardware farms of such devices being automatically operated, like the existing iPhone farms used for similar purposes.
Altman’s orb is as terrifying as it is because businesses might see it as a solution to a real problem—a problem he helped to create.
Pay per interaction model? 1 cent per post.
Probably the only solution. But the penny has been deprecated so it will have to be a nickel.
Only copper was deprecated. Real $0.01 absolutely exists in your bank etc.<p>Anyway, marketers see a popular site like a physical billboard, where they would pay thousands a month for their message to be seen by thousands of people. If you made it cost pennies to post, and a few more pennies to boost and astroturf, AND that the post would be seen by millions of people, they'd say "By Grabthar's hammer, what a bargain!!" and order a hundred more per day...
I think pay per account (like the Metafilter model) would be better. If you charge $10 for lifetime access and ban slop-posters, it quickly becomes expensive to be a slop merchant
Age verification with facial ID? ;)
lobste.rs uses a web-of-trust referral system. I guess it still involves a moderator killing off bad nodes, but it seems to scale well
> it seems to scale well<p>This seems hard to say without knowing how large it is. To me, it seems like a relatively small community, far smaller than HN anyway.
yeah but I can't post there because I don't know anyone with an account and frankly CBA traipsing around looking for someone who has an account.<p>does seem like more things will have to go this way though
Isn’t the solution high-quality identity verification? There are piles of digital identity companies out there. They make money selling to banks for KYC compliance. Heck, there are background check as a service companies designed to add trust to gig economy platforms.<p>I used to think that a small payment could accomplish the same thing, but X selling blue check marks proved that doesn’t help much. Well, at least it’s a much weaker signal than the previous curated version.<p>The challenge is any barrier to entry high enough to discourage motivated spammers is also high enough to discourage casual users. That disrupts the network effects you’ve traditionally needed to bootstrap a social website.<p>If I was trying to get a new social site off the ground right now, I would try:<p>1) secure a good brand from the pre-AI era. Twitter, Digg, Friendster, MySpace. Something that motivates a first look.<p>2) Require third party identity verification on sign up, configured so the social site is never the custodian of PII, though require enough demographics to support high-value advertising later. Verification is free to the user, ideally provide multiple verification options- one US and one EU at minimum.<p>3) Target a few core communities and invest. Find the people who moderate historically great subreddits, were active in twitter communities during the good years, etc. get them in your platform. Maybe even pay them.<p>That should be enough to tell you if it’s going to work or not.
Blizzard's Real ID system would fix all of this. It was ahead of it's time /s
> a community online where AI isnt allowed.<p>This is something I think about a lot, especially how one could pull it off without tearing down anonymity online. Having some sort of "proof of humanity" is a hard problem to solve.
The amazing thing about AI is that you don’t even need AI superfans to shoehorn it into a conversation that doesn’t even touch on AI. Detractors will do it for them.
Ironically, the top comment (this) is now about AI.
> I think someone should start a community online where AI isnt allowed.<p>That's lobsters I guess. AI posts got banned there after a 300+ comment discussion, probably the biggest ever on the site.<p>The exact rule the moderators settled on was "meaningful human authorship" but don't be fooled: a lot of people on lobsters are <i>ideologically</i> opposed to LLMs. Doesn't matter how "meaningfully" the technology was applied. My work was classified as slop simply because AI touched it. People referred to me as an exhibitionist and fetishist when I talked about using AI. Just a heads up for anyone who's thinking of joining.
> a new syntax<p>How is the syntax new?<p>It looks like lispy - see the outer parens in the examples given.
Heh, every time you show a average developer lisp for the first time the reaction is the same. Little do they know conditionals, GC, REPLs, macros and more comes from the syntax and language dreamed up in the 50s/60s.
It’s been a few months, but I built a tool by Janet lang to communicate with an LLM via HTTP. Of course, I probably had Claude Code write it for me. It turned out better than I expected.<p>I was really impressed by how small the executable file was. I’d only ever done web development with Node.js up until then.
> But by allowing you to unquote literal functions, Janet makes it possible to write macros that are completely referentially transparent.<p>These lisp guys really get excited over very abstract things. If you say this to an average person on the street they will probably try to run away.
> very abstract things<p>A C macro with literals that lacks referential transparency:<p><pre><code> #define MULTIPLY(x, y) x * y
int result = MULTIPLY(2 + 3, 4); // 14
</code></pre>
Not knowing what something means does not make it bad, which is what I'm assuming you meant given how you phrased your sentence.<p>Having a shared language of patterns and problems that occur in programming is a good thing. Ridiculing such terminology on the basis of "that group of programmers sure are weird" is pointless and counter productive.
you ever try to explain object oriented programming languages and their benefits to the "average person on the street"?
somehow i also never got the idea around these languages like lisp. I remember i studied them in school - but i quickly forgot and never got around to relearning it.
It took me probably 5 years of writing Clojure before it clicked. Once you get used to structural editing and repl driven development, it’s really hard to go back to syntactic languages.<p>It’s kind of like in treesitter style editing, where you can “swap these two arguments,” “select this function,” “wrap this in a try block” with a single keyboard command… but way more standardized and granular. Plus with the ability to execute anything you highlight<p>All that and then you realize you can store code as data (since it’s just a data structure) and run data as code.<p>I think most programmers don’t realize how arbitrary the difference is between code and data until they get used to using LISP.
Spot on. For me, it clicked with Common Lisp, 15 years after I graduated from university. Now, Clojure is my daily driver. And it’s extremely difficult to explain to people. I’ve gotten to the point where I don’t even try. You’re right about all the things you mentioned. Once you discover structural editing, everything else seems primitive, on the level of cavemen playing with rocks. But it’s not just one feature that makes Lisp better. It’s all of it which interrelates and creates a powerful synergy (I hate that word, but in this case it’s appropriate) that just isn’t matched by anything else. There are other languages that have a similar vibe, notably Forth and Prolog, but they are often misunderstood, too. Honestly, that’s my real test of whether someone is a senior programmer: do they understand and at least have an appreciation for these languages, even if they don’t program in them everyday.
The idea is that instead of having to learn tens of different syntactic constructs with subtle and often arbitrary differences, you just have parentheses and use them to build everything.
This is such a undervalued benefit, once you've learned s-expressions, you can basically learn a bunch of languages without having to learn completely new syntax. It'll be slightly different, with different idioms and names, but a hell of a lot easier than doing the same across every "It's like C but 50% of the syntax is different actually" language out there, which is most of them.
That just moves the subtle and often arbitrary differences to the functions and macros you use.
The kind of subtle difference I’m talking about is that in C, you have to put a semicolon after struct {…} and do {…} while (…), but not after other curly brace constructs. What would be the analogue in Janet?
The first one is pretty C-specific and for example doesn’t exist in Java. Similarly for the second one, the reason is that `while` is used for two different constructs, which for example isn’t the case in Rust. These are just accidental complexities stemming from unfortunate design decisions in C. Having a richer repertoire of syntactic constructs doesn’t by itself imply such complications.<p>My point was, replacing <i>n</i> syntactic constructs by <i>n</i> functions or macros doesn’t reduce the cognitive load of having to know how each construct works. To the contrary, one can argue that everything having the same syntactic form makes it more difficult to distinguish different classes of features.
> The first one is pretty C-specific and for example doesn’t exist in Java.<p>It was just an example, most languages have quirks like this. I don’t know about Java, but in Rust you have the turbofish operator, whose necessity stems from using the less-than sign as both an operator and a delimiter.<p>> My point was, replacing n syntactic constructs by n functions or macros doesn’t reduce the cognitive load of having to know each of them.<p>The difference is that if you don’t know a function/macro, you can just read its documentation. If you don’t know a syntactic construct, where do you look?<p>Another advantage is that if you want to create new functionality similar to existing language features, it won’t stick out like a sore thumb. For example, you could create an until loop:<p><pre><code> (until (window-should-close)
(draw-screen))
# is equivalent to
(while (not (window-should-close))
(draw-screen))
</code></pre>
In Rust, it would have to look completely different from a while loop:<p><pre><code> until!(window_should_close(),
draw_screen());
// is equivalent to
while window_should_close() {
draw_screen();
}</code></pre>
Probably depends on whom you are asking. For me the essence is (1) having functions or procedures as the basic building blocks, not classes. (2) Having all the utility and higher order functions you need to deal with the functions and procedures first idea. (3) Having a very powerful syntax, that allows great semantic editing and is never ambiguous. Oh and can actually be extended in useful ways, without having to wait for a committee to decide upon "the one syntax to rule them all".
> can actually be extended in useful ways<p>I just made a library with [query syntax](<a href="https://codeberg.org/veqq/declarative-dsls" rel="nofollow">https://codeberg.org/veqq/declarative-dsls</a>) over various data structures a la sql:<p><pre><code> (import declarative-dsls/dataframes :as df)
(def people (df/dataframe :name :age :job))
(df/dataframe? people)
(df/insert! {:name "Bob" :age 30 :job "Developer"} :into people)
(df/insert! {:name "Alice" :age 27 :job "Sales"} :into people)
(df/update! :set {:job "Engineer"}
:where |(= ($ :job) "Developer")
:from people)
(df/save-csv people "people.csv" :sep "\\t")
(def people2 (df/load-csv "people.csv" :sep "\\t"))
(-> people2
df/dataframe->rows
df/rows->dataframe
df/print-as-table)
</code></pre>
Printing:<p><pre><code> job age name
-------- --- -----
Engineer 30 Bob
Sales 27 Alice
</code></pre>
It also has datalog and minikanren (with s expr, sharing the same goals etc.) And it vectorizes like APL:<p><pre><code> (df/v + [1 2 3] 1 [1 2 3] 1) # returns: [4 6 8]
(df/v + 1 {:column [1 2 3] :key [1 2 3]}) # returns: {:column @[2 3 4] :key @[2 3 4]}
(df/v * [1 2 3] [[1 1 1]
[1 2 2]
[1 2 3]]) # returns: @[@[1 1 1] @[2 4 4] @[3 6 9]]
</code></pre>
Or you can just use [J directly from Janet](<a href="https://git.sr.ht/~subsetpark/jnj" rel="nofollow">https://git.sr.ht/~subsetpark/jnj</a>):<p><pre><code> (jnj/j "3 4 $ i. 10") # returns: ((0 1 2 3) (4 5 6 7) (8 9 0 1))
(jnj/j "$" [3 4] (range 10)) # returns: ((0 1 2 3) (4 5 6 7) (8 9 0 1))
</code></pre>
The Joy Web Framework has a cool [db query dsl](<a href="https://github.com/joy-framework/joy/blob/master/docs/database-queries.md" rel="nofollow">https://github.com/joy-framework/joy/blob/master/docs/databa...</a>) too: `(var account (db/find-by :account :where {:login (auth-result :login)}))`, used for a [web auth](<a href="https://codeberg.org/veqq/janetdocs/src/commit/848dcbd8e54ad5e0e8555abc0b5c72dab1720282/routes/home.janet#L79" rel="nofollow">https://codeberg.org/veqq/janetdocs/src/commit/848dcbd8e54ad...</a>).<p>From my response, bigger than the article: <a href="https://lobste.rs/s/y0euno/why_janet_2023#c_lspe6n" rel="nofollow">https://lobste.rs/s/y0euno/why_janet_2023#c_lspe6n</a>
> studied them in school - but i quickly forgot and never got around<p>Because industry lied to you, promising "simplicity and riches". The industry didn't just overcomplicate programming. It institutionalized the complication. Why? Because complexity is a moat.<p>Complex frameworks need certified experts. Certified experts charge more. Companies built around expertise need the complexity to persist. So the complexity gets marketed as sophistication.<p>They've promised: "Java/C# will get you hired anywhere", but you're hired to write xml (these days yaml). "OOP models the real world", they said. The real world doesn't have abstract factory visitors. "Design patterns make you senior", but you only learned workarounds for language deficiencies. "Learn the framework, get the job". Framework dies, you start over. "Specialization is valuable". you're now hostage to one ecosystem.<p>A programmer who understands fundamentals is dangerous to this system. The fundamentals:<p>- a function transforms input to output.<p>- composition builds complexity from simplicity.<p>- types describe what's possible.<p>- effects should be explicit.<p>And then you realize that Lisp is the skeleton key. All that above is Lisp, or came from Lisp. Every language is either: Lisp with different syntax, or C with different syntax, or arguing between the two.<p>If you learn Lisp, you don't learn a language. You learn what languages are. You're no longer a consumer of a programming language or two, or a few. You are native speaker in all of them.
Pretty straight-forward, as the world as we perceive it is made of objects with attributes, interacting with each other via their methods. OOP easily fits the brain of the average person in the street.
> the world as we perceive it is made of objects<p>Of course easier to explain the "strategy pattern" to a florist, instead of saying "imagine a function that takes a function". Who the hell understands functions? Such a mind-bending concept, literally nobody really knows how they work. Einstein famously complained about it. Too bad he didn't know OOP - would've been so much easier. I couldn't grok general and special relativity for so long, thank god I've found Java - it made it so much easier. I don't know what Persian mathematicians been smoking in 12th century to come up with this utterly fucked up idea of a function. And fuck Leibniz as well.
[dead]
I started writing a Scheme interpreter about a year ago and got pretty far. I dropped it a few months back since I got a new job.<p>I'm thinking of getting back and am wondering if the niche (and difficult for me to implement) features are worth it. I might be better off skipping dynamic-unwind, maybe even ripping out call/cc, in favor working on the debugability, ecosystem, performance, and package management story.
> If you say this to an average person on the street they will probably try to run away.<p>This is the average reaction I get any time I get the "so what do you do" question. I try to stay very vague "I do computer work" or something. Or I'll say "Oh, nothing interesting" and try to change the subject. Any more specific than that and they start looking for the exits.
Average programmer too /j<p>Frankly, though, I think lispy community has benefited from being smaller. For example, even though the now ancient Design Patterns already warned programmers to prefer composition over inheritance, the OO programmers still created 15 levels deep hierarchies.
> over very abstract things.<p>I beg to differ. There's just isn't "easy and straightforward" path to simplicity. We thought that explaining the world with "objects" was simple and instead of using already existing language, OOP took "objects" (an easy choice) and invented a elaborate taxonomy of "patterns" to work around the limitations of objects. Just look at this mess:<p>- Strategy Pattern: Interface + multiple classes + dependency injection + factory maybe. Bruh, it's just a function that takes a function.<p>- Singleton: Private constructor + static instance + thread safety + double-checked locking.
Bruh, it's a fucking value. You define it once. It doesn't change. You're done.<p>- Observer/Event System: Interface + listener registration + event loop + memory leak when you forget to unsubscribe. Bruh, tis a fucking function applied to a list (or stream).<p>- Decorator; Wrap a class in another class that implements the same interface. Bruh - it's function composition. You learned this in algebra class before you turned fourteen.<p>- Command: Encapsulate a method call as an object with execute(), undo(), history queue... It's a function stored in a variable. That's it. That's the pattern.<p>- Factory: Separate class whose entire job is to call constructors. Come on, it's just a fucking function.<p>- Template Method: Abstract base class with a method that calls abstract methods subclasses must override. It's a higher-order function.<p>- Iterator: Interface with hasNext() and next(), mutable state, ConcurrentModificationException. It's fucking map.<p>The Gang of Four book exists because Java made functions second-class citizens, so programmers spent 20 years building elaborate object scaffolding to simulate... functions. FP didn't solve these problems. It just never had them.<p>Yet somehow the industry likes to pretend that every programmer knows (or should know) OOP, while keep telling everyone how hard programming is.<p>Those who found the truth understand that there's a reason why Lisp just refuses to die and it's unlikely it ever will. At 70 years, it is still flourishing.
> The Gang of Four book exists because Java made functions second-class citizens<p>Why do people write silly things like this? GoF was <i>published</i> in 1995, the same year Java was first released, and includes neither Java code nor any mention of Java. Java had no influence on that book.
iLemming, your reply is [dead] and I don't know why. Responding to parts of it:<p>> Peter Norvig made this argument explicitly in 1998, showing 16 of 23 patterns are "invisible or simpler" in Lisp<p>The GoF book even mentions this so Norvig's presentation is a useful read, but even the authors of the book knew it was true. It's not like he added a new idea with that bit you quoted, the useful parts of the presentation were <i>which</i> patterns became invisible or simpler and why.<p>> Let's try not to nitpick on literal wording to avoid engaging with the substance, could we?<p>I responded to a common, but false, claim. Don't make false claims and I won't call you out for it.
You can replace Java there with pretty much any OOP language, where functions are not first-class citizens, and it will still be true. There are no "false claims" here. The main point is valid. We have orchestrated an entire industry around "objects", while much simpler abstractions have already existed. You probably just have not experienced the "true" nature of Lisp, where you can interactively change any behavior of the running program, directly from your editor, without linking, linting, compiling, restarting or even saving the code you type. The process is an enormously joyful experience, it feels like playing a video game. You probably have little idea of what we've lost and what we've gained from the industry heavily tilting towards OOP.
> There are no "false claims" here.<p>You wrote:<p>>> The Gang of Four book exists because Java made functions second-class citizens<p>That is a false claim. You asserted a causal relationship between Java and the content of the GoF book that does not exist without time travel.<p>> You probably just have not experienced the "true" nature of Lisp, where you can interactively change any behavior of the running program, directly from your editor, without linking, linting, compiling, restarting or even saving the code you type.<p>Sure buddy. You know <i>so</i> much about me...
OMG. You got me. I'm so, so sorry you caught me spreading lies about your precious programming language (or your favorite book, I don't know what you're trying to protect more). Thank you from the bottom of my heart for the diligent work of protecting the truth and keeping this place free of disinformation. Please send me a DM with your mailing address and I'll send you a medal, shipping cost included.<p>> Sure buddy. You know so much about me...<p>I should have checked your comment history first before making assumptions. Please accept my apologies if I sounded patronizing. Shouldn't be an excuse for my tone, in my defense I could say: "I said 'probably'". Still disagree with you overly correcting me since I firmly believe the overall notion of my original comment is correct. Thus I won't remove my snarky, sarcastic paragraph above.
[dead]
> <i>These lisp guys really get excited over very abstract things. If you say this to an average person on the street they will probably try to run away.</i><p>Referential transparency is a funny name for a very powerful feature which helps you understand what the program does better, it's not a deeply abstract thing. Don't let the name scare you.<p>You could ask "why the funny name"? Well, specialized professionals use specialized jargon, even for "normal stuff". It's unreasonable to expect otherwise. Car mechanics also have weird names for car parts that are absolutely essential for the car and not that hard to understand if they explained them to you.
This document was really helpful when I first met Janet:<p><a href="https://janetdocs.org/tutorials" rel="nofollow">https://janetdocs.org/tutorials</a><p><a href="https://janet.guide/" rel="nofollow">https://janet.guide/</a> (the author's one)
First time I've seen 'wat' used as a noun, I like it.<p>(for those unfamiliar with the reference: <a href="https://www.destroyallsoftware.com/talks/wat" rel="nofollow">https://www.destroyallsoftware.com/talks/wat</a>)
I've been drawn into the Janet posts that surface every once in a while here on HN, but found the otherwise highly praised "Janet for Mortals", not being for mortals at all.
I have some gentler introductory stuff like: <a href="https://janetdocs.org/tutorials" rel="nofollow">https://janetdocs.org/tutorials</a>
> I've been drawn into the Janet posts that surface every once in a while here on HN, but found the otherwise highly praised "Janet for Mortals", not being for mortals at all.<p>I'm surprised: the language is very straightfoward, simple, very few rules to remember. It's a Lisp but with a very small surface area.<p>I mean, compared to other languages, Janet really is easier to lean, so I'm surprised that the book for it is difficult (did not read the book, but familiar-ish with the language. I don't have anything but praise for it, TBH).
Personally I get hung up on the macro syntax being near the beginning, but there is so much valuable stuff past that
> not being for mortals at all.<p>I had that with Haskell. Although, while Haskell is too hard for me, I actually like its syntax.<p>Janet seems to be Lisp 2.0, so the syntax is lispy.
Seems some of the listed advantages for Janet would also apply for tcl (small/simple, easy to learn, embeddable, usable as a shell, great for domain specific languages). It would be interesting, to me at least, to see a fan of Janet compare the two.
I've only used Tcl briefly, mostly for automation which it's great at. But it's a Algol-like imperative language, doesn't have any type of macros and makes everything based on strings (which makes sense for automation) instead of lists, with all the tradeoffs that comes with.<p>It seems easier to figure out what the similarities are, because I think they're pretty few, they seem to differ more than they are similar.
Tcl is pretty good at functional-programming type stuff, and it can absolutely do anything that you could do with a macro. It isn't Algol-like at all imo, maybe beyond some superficial syntax. It feels a lot more like if LISP and Bash had a baby out of wedlock.<p>(I've written a lot of Tcl over the years and it'll always have a spot in my heart)
Tcl being based on strings creates the same problems like in bash scripts, i.e. it is too easy to misuse the quotation rules, leading to subtle bugs.<p>Using for scripting LISP-like languages is much more foolproof, especially for more complex scripts.
Janet is faster, but lacks anything like tk. It's probably also quicker to learn, as you don't get into complex evaluation structure until you start messing around with quasiquotes, while tcl requires you to understand mixing 3 different layers of evaluation right off the bat. tcl's vm imo is easier to understand as well.<p>tcl if you want a UI, janet if you want an embedded scripting language.
Wow I never realized Janet was released more than 10 years after Clojure.<p>Clojure: 2007<p>Janet: 2019
The author does not mention that Janet comes with _built-in_ networking<p>Having tried many tiny interpreters over the years, that's relatively rare IME
This got me thinking of Hy. I wonder how syntactically close they are; there might be an exploitable Python -> Hy -> Janet path here.<p>[0] <a href="https://hylang.org/" rel="nofollow">https://hylang.org/</a>
I use both. They're similar for simple use, but above a certain level of complexity Hy has a lot of Python-isms that bleed through. It really doesn't ever let you forget that underneath all the parentheses you're really writing Python. Janet feels like its own stand-alone language in that respect, where Hy is more like a syntax swap.<p>I have the impression that Hy's user base is larger, though (not that either one is huge).
I used Hy for a long time, then tried Janet, and ultimately realized that I wanted more batteries included but didn't want Python... So I forked <a href="https://github.com/rcarmo/go-joker" rel="nofollow">https://github.com/rcarmo/go-joker</a> and am tinkering with it until it does all I want.
Previously (April 2023) | 140 comments: <a href="https://news.ycombinator.com/item?id=35539255">https://news.ycombinator.com/item?id=35539255</a>
Does embedding Janet still lean on global state?
My first question too, and I checked out the linked book [1], and sure seems like it! There's global functions like `janet_init()` and `janet_loop()` all over the place.<p>A language shouldn't advertise itself as "embeddable" if it does this. It means you can't have multiple interpreters, you can't use it on multiple threads, etc. GNU Guile does this too, and it's a baffling decision! For my field (audio plugins like VSTs), it means it's absolutely a no-go, because hosts can load any number of instances of your plugins and potentially run them in parallel in the same address space, they <i>can't</i> rely on global state like this. Each interpreter has to be separate.<p>Lua does this right, as does Python (as of 3.12, when they made the GIL local to each interpreter) and I think most of the JavaScript engines. And it's not hard, instead of a global `janet_init()`, just have an opaque pointer bundle all the state, like `janet_init(interpreter)`. If you want a global interpreter, just stick it in a global variable.<p>[1]: <a href="https://janet.guide/embedding-janet/" rel="nofollow">https://janet.guide/embedding-janet/</a>
> Instead of regular expressions, Janet’s text wrangling is based around parsing expression grammars. Parsing expression grammars are simpler, more powerful, and more predictable than regular expressions.<p>I would dispute that this is the case. In PEGs, alternatives are not commutative, unlike in regular expressions. This can lead to quite frustrating debugging. While a valid choice, the advantage over REs is overstated.
I'd argue they are not commutive in regexes either, at least as implemented in practice. Implemented regexes favor the leftmost alternative even when both sides of the alternative match. This matters in cases like: capturing groups, and backtracking implementations. There absolutely are cases where one ordering of alternatives could yield catastrophic backtracking for some input, while the other will avoid it completely.<p>I personally don't like this at all. This means that regex engines that try to generate optimized matching code for an expression can end up generating suboptimal code if you don't want alternative order to matter, since the engine needs to keep that invariant, except in the case when it can prove that the alternatives won't overlap, and a later one can be checked in constant time. If both are true, it is legal to reorder them to do the constant time check before the big complicated wildcard-filled alternative.<p>But personally, I have never written a regex where I actively cared about the alternative evaluation order. I've used some other people made where order is important but never written one myself.<p>I'd love to be able to tell the engine "feel free to swap the evaluation order of my alternatives while optimizing", but few if any such engines offer that as a feature.<p>Now I get that PEGs have commutivity problems are that are different from regexes', which make the issue worse, but that doesn't mean regexes do things right either.
Something I'd observe here: without expressing an opinion about PEGs vs regexes, I'd note that regexes are much more widely used. They're also completely sufficient for an awful lot of text processing tasks. PCRE regexes would be a great inclusion to the stdlib, and would probably be popular.
The non-commutavity is a feature, not a bug. It allows you to have clearly defined parsing for grammars that would traditionally be considered ambiguous.
"small peg tracer"[1] is really helpful for breaking down a PEGs operation<p>[1] <a href="https://github.com/sogaiu/small-peg-tracer" rel="nofollow">https://github.com/sogaiu/small-peg-tracer</a>
PEGs are just soooo much easier to read than regexes for anything more complex than a few words or single line matching. REs are a hammer that tempts people to see everything as a nail, but once one progresses beyond that phase one usually wants as few REs as possible.
Came here for this comment. Janet would score positively in my mind if the evolutionary dead-end PEG were replaced with a grammar parser that is known to work under all circumstances.
Thought this might be about JANET, the rationale for which I have never really understood. The wikipedia article on it is not very explanatory: <a href="https://en.wikipedia.org/wiki/JANET" rel="nofollow">https://en.wikipedia.org/wiki/JANET</a>
Maybe needs a (2023) in the title?
DSLs. Creating a language that only you know that will double the learning curve for the folks coming after you. It's fine for personal projects, but almost always an anti-pattern.
The shell DSL is what made me want to try Janet
The embeddability sounds very appealing. Does anyone have experience with using this somewhere one might traditionally reach for Lua?
if those are the reason why you love janet, then you will love tcl because you will be able to do all the same things without drowning in parenthesis and weird syntax.
There are three languages worth learning that expand your mind: Lisp, Forth and Tcl. Despite all exhibiting homoiconicity, they couldn't be more different from one another.<p>(I'd include Rebol but it's as mind-blowing as it's dead technology from a lost timeline)
Dammit, Janet, I love you!
Pretty compelling, especially "Janet does not adhere to the ancient customs. CAR is called first. PROGN is called do. LAMBDA is fn, and SETQ is def." - a sign of good sense for sure!<p>How fast is it?<p>Also my main objection to Lisps is still the horrible bracket syntax. Yes it's unambiguous and easy to parse, but it's HORRIBLE to read and edit. I wish this project had been a success (or something similar to it): <a href="https://readable.sourceforge.io/" rel="nofollow">https://readable.sourceforge.io/</a><p>Also I don't think static typing is really optional for me at this point.
Actually not all those are ancient customs, and not all that Janet uses is newer.<p>In the first description of the language LISP, from March 1959 (AIM-008), John McCarthy had used the names "first" and "rest", instead of what later will be called "CAR" and "CDR".<p>The names of "CAR" and "CDR" appear to have come from the students who worked at the practical implementation of the LISP interpreter on an IBM 704, and unfortunately we have remained stuck with them, like also with other features that were intended only for a temporary use, until being replaced in the "final version" (which was abandoned).
> Pretty compelling, especially "Janet does not adhere to the ancient customs. CAR is called first. PROGN is called do. LAMBDA is fn, and SETQ is def." - a sign of good sense for sure!<p>Just FYI, many of these are also done in Scheme and its derivative Racket. They kept lambda (but even Python did that), but progn -> begin, setq -> set!, car -> first, and so on.<p>> Also my main objection to Lisps is still the horrible bracket syntax. Yes it's unambiguous and easy to parse, but it's HORRIBLE to read and edit.<p>I have pretty mixed feelings at this point. I don’t mind it for normal programming, but when I do numerical programming (physics models, etc.) you often get extremely long and verbose expressions that are IMO difficult to parse compared to the math-like infix operator notation used in other languages.
I'm starting to prefer the s expression syntax when dealing with tree structures like json.<p>I wonder if we were raised on tree based algebra if math would be easier to do, or harder.<p>Like, solve for x.<p><pre><code> (= (+ (* 2 x) 3) 11)
(= (* 2 x) (- 11 3))
(= (* 2 x) 8)
(= x (/ 8 2))
(= x 4)
</code></pre>
Though this isn't too bad.<p><pre><code> (= (+ (pow x 2)
(pow y 2))
(pow r 2))</code></pre>
I think also a lot of my objections could be worked around if one simply had a "math" macro that evaluates infix math notation as a DSL, similarly to how the CL "loop" macro does a DSL for iteration.<p>Perhaps this exists already somewhere?
> exists already<p>The helloworld of macros lets you do `(infix 1 + 2)`:<p><pre><code> (defmacro infix [a op b]
~(,op ,a ,b))
</code></pre>
A useful one with precedence letting you to `(infix 2 + 4 * 5)`:<p><pre><code> (defmacro infix [& toks]
(def prec {'+ 1 '- 1 '* 2 '/ 2 '% 2})
(var pos 0)
(defn climb [min-p]
(var left (toks pos))
(++ pos)
(while (>= (get prec (get toks pos) -1) min-p) # nil/operand -> -1, stops the loop
(def op (toks pos))
(++ pos)
(set left ~(,op ,left ,(climb (inc (prec op)))))) # inc => left-associative
left)
(climb 0))
</code></pre>
But ultimately, APL notation is best: <a href="https://git.sr.ht/~subsetpark/jnj" rel="nofollow">https://git.sr.ht/~subsetpark/jnj</a>
> Perhaps this exists already somewhere?<p><a href="https://janet-lang.org/spork/api/infix.html" rel="nofollow">https://janet-lang.org/spork/api/infix.html</a>
I definitely prefer s-exps over both xml and json myself too!<p>Interesting question. Much of the difficulty does stem from mentally translating back and forth between conventional notation and s-exps too, since you can’t really avoid the standard notation when reading and writing math and physics papers. And current-day math and physics notation has been optimized to some extent for the infix notation; perhaps one would have invented more expressive higher-order functions or macros to denote s-exp math if that was what everyone used for centuries.
If you ever used an RPN calculator then this is very familiar
All programming languages have horrible syntax (except maybe Forth). Some examples:<p>Statements are terminated by either a dedicated graphical character, in which case it's easy to forget the character and have a problem, or by a newline (or maybe a different white space character, but I haven't encountered that yet) in which case decent formatting of code may require a dedicated graphical character to indicate that the newline DOESN'T terminate the statement, in which case we have the same problem. Having newline-terminated statements without continuation character would be consistent, but would hamper readability because identifiers would need to be strictly limited in length to keep certain lines from exceeding available screen space (or alternatively readability would suffer from lines only being partially readable).<p>And that's before getting into the weeds of how mathematical notation is tricky (most people have learned infix notation at maths class in school, so they mightn't appreciate how horrible it is), how different types of brackets (round, square, curly) can have inconsistent semantics, the downsides to the various ways of indicating lexical blocks (brackets, white space, keywords,...), et cetera.<p>The ideal programming language would probably be one which allows switching between different syntaxes based on what works best for the user (for example, someone could write code in S-expressions, another person could have that code automatically translated into SRFI-119 Wisp expressions and work with it like that, a third person could then have it rendered into something more Lua-like,...). Which is something I think the Racket people are working on, but I may be mistaken.
Syntax is not that important to me. I prefer Python style indentation, but its really not that important - its just something to get used to for me.<p>Is static typing that important for a scripting language? From the intro to the book:<p>> And to be clear, I’m not going to try to convince you to bet your next startup on Janet, or even to use it in any sort of production setting. But I think it’s an excellent language for exploratory programming, scripting, and fun side projects.
> Also my main objection to Lisps is still the horrible bracket syntax. Yes it's unambiguous and easy to parse, but it's HORRIBLE to read and edit.<p>I use Parinfer, which allows me to edit Janet as if it was an indentation-based language.
It's a scripting language, so it's not going to compete with anything compiled or JITed, but it has a pretty efficient threaded bytecode interpreter (that is almost more interesting than the language itself!). It's certainly good enough for most situations where you would reach for a scripting language.
AoT/JIT compilation is a property of the implementation, not the language.<p>It would be good to know order of magnitude anyway. Like, are we talking Ruby/Python level, etc.
In my tests, it's 5-10x Python for long running things (about 30% slower than Fennel on LuaJit) but for small things, because you can easily shift work to compile time, it beats normal Go: <a href="https://codeberg.org/veqq/verse-reader#performance" rel="nofollow">https://codeberg.org/veqq/verse-reader#performance</a>
> How fast is it?<p>Roughly as fast as puc-rio Lua. It won't blow your socks off, but it's more than respectable.
Out of those renames, I agree with car->first and progn->do. setq is ugly, but I think using def is maybe questionable. lambda I would have just kept the same.
Are you aware of:<p><a href="https://docs.racket-lang.org/sweet/index.html" rel="nofollow">https://docs.racket-lang.org/sweet/index.html</a>
Janet is ALMOST an incredible tool...but what I want is a very clear bifurcation between the standard library's stateful mutating procedures, and stateless value-returning functions. I ran into that wall hard trying to make something non-trivial.<p>It also turns out that the mix is due to the standard library leaning on raw C loop iterations underneath whenever it can. Which is great! But it confuses the library's interface paradigms.
Luxferre.top has some Janet based softwrae.
Excellent. Although I suspect the author of the programming language invented this Janet for all the perfect puns. Yes, Janet. No. Janet.
Damn it, Janet. No proper namespaces. Hard pass.
> I never thought it could happen to me.<p>But I am truly biased. I have basically forgotten how to code everything else (besides APL family languages) in the past _checks notes_ 10 months since I started Janet. I even run a community [docs site](<a href="https://janetdocs.org/" rel="nofollow">https://janetdocs.org/</a>) and am writing [my own tutorial](<a href="https://janetdocs.org/tutorials/learn-to-program" rel="nofollow">https://janetdocs.org/tutorials/learn-to-program</a>) (albeit slowly). I even use it in production for all new software (within 3 weeks of starting, I had rewritten all personal scripts etc.)<p>> Janet is simple<p>You can do literally everything with just hashmaps. The whole language is basically a hashmap, implementation wise. `(keys (curenv))` prints out all locally defined symbols. `(keys (getproto (curenv)))` prints the parent hashmap of the current environment i.e. all the core symbols. I don't, but you can basically do CLOS via hashmaps (and there is a [fuller implementation](<a href="https://git.sr.ht/~subsetpark/fugue" rel="nofollow">https://git.sr.ht/~subsetpark/fugue</a>) too.)<p>> Janet is distributable<p>I have like 20 websites and another dozen or so services running on Janet (with the [Joy webframework](<a href="https://github.com/joy-framework/joy" rel="nofollow">https://github.com/joy-framework/joy</a>) which I wrote a [tutorial](<a href="https://janetdocs.org/tutorials/Joy-Web-Framework" rel="nofollow">https://janetdocs.org/tutorials/Joy-Web-Framework</a>) for), on a single free-tier VPS with 512mb of RAM.<p>> Janet has ... immutable collections<p>...not really. In reality, the whole standard library constantly returns mutable versions from everything. There's no reason to really try to be immutable at this point. Although there are cool [combinator libraries](<a href="https://git.sr.ht/~subsetpark/apcl-janet" rel="nofollow">https://git.sr.ht/~subsetpark/apcl-janet</a>) and I've even made combinatorish versions of basic functions:<p><pre><code> (defn better-cond
[& pairs]
(fn :bc [& arg] # names for stack traces
(label result
(defn argy [f] (if (> (length arg) 0) (apply f arg) (f arg))) # naming is hard
(each [pred body] (partition 2 pairs)
(when (argy pred)
(return result (if (function? body)
(argy body) # calls body on args
body)))))))
</code></pre>
Combinatory inspired cond, which allows for pairs. The test does not need an argument and the body may be a simple value or a function:<p><pre><code> (map (better-cond
string? "not a number"
odd? "odd"
even? "even")
[1 2 3 "cat"]) # the args!
(map
(better-cond
1 (fn [arr] (array (min ;arr) (max ;arr)))) # (recombine array (unapply min) (unapply max)))
(partition 2 (range 10))) # these are the args!
((better-cond
< "first is smaller"
> "second is smaller")
5 3) # these are the args passed into the func! I am excited!
</code></pre>
> Janet lets you pass values from compile-time to run-time<p>That's what got me hooked, in a few ways. In Racket or Go, I had to do a lot of work to process data at compile time so the runtime could literally just be a lookup table. In Janet? That's the default behavior of any `def` outside of main. The following turns a .tsv of the bible into a hashmap in the binary, when compiling:<p><pre><code> (def verses (reduce (fn [acc line]
(let [parts (string/split "\t" line)]
(if (= (length parts) 5)
(let [[_ abbrev ch vs text] parts]
(put-in acc [abbrev ch vs] text))
acc)))
@{}
(string/split "\n" (slurp "kjv.tsv"))))
(def abbrev-array (keys verses)) # also makes an array of the abbreviation column
</code></pre>
So the rest of the program is literally just accessing the hashmap ([twice as fast](<a href="https://codeberg.org/veqq/verse-reader#performance" rel="nofollow">https://codeberg.org/veqq/verse-reader#performance</a>) as the Golang version using `embed`):<p><pre><code> (defn main [_ & args]
(if (or (empty? args) (= "-h" ;args) (= "help" ;args))
(do (print "Usage: kjv <book> [chapter:verse]") (os/exit 1))) # show help
(let
[Capitalized (string (string/ascii-upper (string/slice (first args) 0 1)) (string/slice (first args) 1))
book (find |(string/has-prefix? $ Capitalized) abbrev-array)]
(pp (match args
[_ chap verse] (get-in verses [book chap verse])
[_ unsure] (match (string/split ":" unsure)
[chap verse] (get-in verses [book chap verse])
[chap] (get-in verses [book chap]))
[_] (verses book)))))
</code></pre>
The equivalent go program was 5x longer and required an extra program to convert data into a 40k line .go file with a giant literal hashmap, to be faster than the naive Janet.<p>...but actually Ian Henry means Janet e.g. keeps closures synced across images/sessions:<p><pre><code> (defn timer [t]
(var t t) # this is slightly annoying, must shadow as params are immutable
[(fn [] (set t (+ t 1)))
(fn [] (set t (+ t 2)))])
(def tx (timer 0))
# call like this:
((tx 0))
((tx 1))
# make an image and save it to file
(def my-module @{:public true})
(spit "test.jimage" (make-image (curenv)))
</code></pre>
Exit and start a new REPL session:<p><pre><code> (defn restore-image [image]
(loop [[k v] :pairs image]
(put (curenv) k v)))
(restore-image (load-image (slurp "test.jimage")))
((tx 0))
</code></pre>
It saved the closure and all relevant image in the `(curenv)` hashmap.<p>Condensed from my longer response: <a href="https://lobste.rs/s/y0euno/why_janet_2023#c_lspe6n" rel="nofollow">https://lobste.rs/s/y0euno/why_janet_2023#c_lspe6n</a>
[flagged]
[flagged]
[dead]
<p><pre><code> (defn foo [first & rest] ...)
</code></pre>
So basically Lisp 2.0.<p>Although, this here is a good idea:<p>"pass values from compile-time to run-time"<p>Would be nice if some kind of "scripting" language
be as fast as a compiled language, but without
ruining the syntax. Just about 99% of the languages
that are shown, have a horrible syntax. Syntax is not
everything, but most language designers don't understand
that syntax also matters. So tons of horrible languages
emerge. Nobody will use those languages, so 99% of them
will die off quickly.
What would be a better syntax according to you? I have found Janet’s syntax very pleasant to work with as opposed to JavaScript, Lua or even Python.
can't there theoretically be a language which transpiles to Janet to get all the benefits without additional paranthesis too?<p>Not sure if such transpilation would have a perf hit though, I hope somebody responds who knows about it more.<p>I don't deny that syntax matters itself too but there are some ideas of janet like sandboxing and other features which seem to me to be worth implementing in other languages too.<p>Personally, I would be really interested in a language like lua/wren which can transpile to Janet too.
"... all the benefits without additional parenthesis too?"<p>I guess you don't like Lisp's syntax. I didn't either until I realized the key insight: when you're writing Lisp, you're basically writing an AST. Which is why it's so easy to manipulate your code. Want a new feature the language doesn't have, such as the pattern-matching they added to C# a few versions back? <i>You can add it yourself</i>; you don't need to wait for a language committee to implement it years after you needed it. That's all that macros are: functions that take AST and return AST, which is then executed.<p>And once I realized that Lisp's syntax was basically an AST, I no longer saw the parentheses. Now I just see blonde, brunette, redhead... Oops. Sorry. Wrong reference.
> like lua/wren which can transpile to Janet too.<p>Really? I've used dozens of languages and honestly, I just can't wrap my head around how ugly Lua code can get. At first, I tried treating it as "javascript with no bad parts", turns out, modern JS is far, far better than 1996 JS and nicer than Lua. The most annoying part about Lua is that I never know how to format it for better readability - should I add line breaks, or not, etc. lua-fmt often just makes it worse.<p>When I found Fennel I immediately moved to it, even though it was "experimental". Since then, I just don't want to deal with Lua, aside from some small one-liners.
I guess you could transpile direct to Janet bytecode, and performance would be in theory the same as native Janet?
Why, Henry?
why is it called Janet? perhaps to prevent it to be identified with the acronym for Lots of Irritating Single Parenthesis?
It was named after the sentient computer system in the TV show "The Good Place"<p>A humourous clip: <a href="https://youtu.be/etJ6RmMPGko?si=W98LdG1jDdUCXsHV" rel="nofollow">https://youtu.be/etJ6RmMPGko?si=W98LdG1jDdUCXsHV</a>
If it was called [Something] Lisp, Lisp enthusiasts would complain that it’s not a lisp because it does not use linked lists as the primary data structure.
I know that Lisp has lots of paranthesis and I don't have enough experience with Lisp at all.<p>But from the looks of it, Janet has some great ideas like the one that @ramblurr shared here about sandboxing ("Disable feature sets to prevent the interpreter from using certain system resources. Once a feature is disabled, there is no way to re-enable it.")<p>Lisp from my understanding is incredibly polarizing and many people love it and many people hate it and that's fine, but at a certain point wouldn't it feel repetitive for statement like this and I am unsure of how healthy discussion about programming concepts can be done this way.<p>There are so many interesting things from lisp-y languages like Janet and Julia is technically lisp-y too and Julia's compilation to GPU is awesome and Nim too which can compile to C/C++/JS!<p>It's just so many interesting concepts overall in programming that paranthesis don't seem a concern to me as the underlying concept can be translated to something else, like sandboxing feature, transpilation to GPU or multiple targets!<p>And there are many unique concepts in non-lispy languages like golang (cross-compat, portability with static binaries), elixir (concurrency!) too.<p>It's just good to see the amount of innovation within programming from all spheres of influence :-D
> Lisp from my understanding is incredibly polarizing<p>No it's not! It's as "polarizing" as "group theory" or "set theory". Lisp is fucking math - it maps closely to formal mathematical/logical notation. You just can't "hate" math - you can be confused by it, be unfamiliar with it, intimidated by it. But hatred directed at something that is simply precise and consistent says more about the person than the thing.<p>This is basically a reoccurring theme on every programming forum, whenever a Lispy PL gets mentioned. There are tons of confused programmers who look at Lisp examples and "hate" it. Without a single practical experience of using Lisp. They don't know anything about structural editing, they never experienced REPL-driven development. And I'm not talking about shit like "Python REPL", which is a bleak attempt, a shallow shell compared to the "true Lisp REPL".<p>It takes a bit of time and curiosity to realize how enormously powerful, beautiful and practical the idea of Lisp is. And it's really sad that smart people refuse it outright, without even attempting to understand it. Sure, it may take some time to discard the old habits that took years to build and accept this unfamiliar thing. Yet there's a point, after which comes the realization that Lisp can literally replace every single programming language with better ergonomics. I'm so mad at myself for wasting huge chunk of my life, chasing things of lesser importance, instead of just figuring out Lisp sooner.<p>I guess, to a degree you're right - you either hate Lisp or love Lisp, there's no in-between. But "hate" means you simply don't know it. Once you do - there's no way not to fall in love.
While I do not like the excess of parentheses of LISP and similar languages, their syntax is very consistent and predictable. Moreover, while LISP has an excess of parentheses, it omits a greater number of commas that are required in many other programming languages.<p>I am much more annoyed by the random syntax inconsistencies of most popular programming languages, which are either caused by original language design mistakes, or, more frequently, by the late addition of some features that were not planned in the original language, so they had to be squeezed in with the help of various ugly workarounds.<p>While during the last years I have not used much LISP like languages, there have been times when I used them a lot, for several years, in scripting applications, e.g. the LISP variant of old AutoCAD, the Scheme-like scripting language of the Cadence EDA applications, or the scsh Scheme dialect that is usable for replacing UNIX shell scripts.<p>In all cases, these languages allowed a greater productivity associated with rarer bugs than the more popular scripting languages, like Python, Perl, TCL, bash.<p>While aesthetically I might prefer the look of a Python program, for solving a practical production problem I would prefer to write scripts in one of the LISP derivatives. Obviously, the productivity in various programming languages depends a lot on individual preferences and previous experiences.<p>It should be noted by all those who believe that the LISP-derived languages have too many parentheses, that the C programming language and all languages with syntax derived from it, like Java or Rust, have a great excess of parentheses in comparison with the older languages that had better designed syntaxes, e.g. ALGOL 68 or IBM PL/I.<p>For example, compare<p><pre><code> for (i = 1; i <= 100; i += 5) { ... }
</code></pre>
with<p><pre><code> for i from 1 to 100 by 5 do ... od
</code></pre>
or<p><pre><code> if ( ... ) { ... } else { ... }
</code></pre>
with<p><pre><code> if ... then ... else ... fi
</code></pre>
The first example has 12 syntactic tokens instead of the minimum required, which is 6.<p>The second example has 8 syntactic tokens instead of the minimum required, which is 4.<p>If I cannot have a decent programming language with a minimum number of parentheses, I would rather have a programming language where all the places that need parentheses are predictable, like in LISP, instead of having a language like C and its derivatives, which require parentheses in random places, for no good reason at all.