108 pointsby thatxliner8 hours ago19 comments
  • ecto5 hours ago
    Readers may enjoy my lisp, Loon, which takes heavy inspiration from Rust https://loonlang.com/guide/ownership
    • imachine1980_2 hours ago
      How does ownership work within the Lisp tree structure?, What is the difference between ownership on this setting and ARC?
      • ecto2 hours ago
        ARC refcounts everything (many owners) whereas Loon refcounts only inside immutable shared tree nodes (one owner per handle)
    • kibwen3 hours ago
      Agreed, a Lisp built around the concept of ownership is much more interesting than just a way to write Rust via S-expressions.
    • akch2 hours ago
      That page is beautiful! What ssg / theme are you using to build it?
      • ecto2 hours ago
        Thanks :) Check out the code - it's Loon! https://github.com/ecto/loon/blob/main/web/src/pages/guide/o...
        • helenite16 minutes ago
          The website seems to have some bugs on mobile, seen on Chrome 147.0.7727.137

          - Cannot horizontally scroll the code snippets on homepage when it overflows. The scroll bars appear but swiping the snippet does nothing. - Footer links are unresponsive (loon, GitHub, MIT Licence links) - In the changelog page, scrolling makes the hamburger menu hide release dates behind it - Hamburger close chevron looks misaligned (not sure if this was a deliberate choice)

    • quotemstran hour ago
      I like the ubiquitous type inference. It reminds me a bit of ELSA for Emacs Lisp: https://github.com/emacs-elsa/Elsa. In particular, type aware macros have been on my wishlist forever: there's no good reason I shouldn't be able to write, e.g. an elisp or CL/SBCL compiler-macro that specializes an operation based on its inferred type. In normal lisps, it's hard to get even the declared types.

      That said, I wish that part of Loon were less coupled to the allocation model though. What made you opt for mandatory manual memory management in an otherwise high-level language? And effects?

      There are two things common in language design that, honestly, strike me as unnecessary:

      1. manual allocation and lifetime stacking, and

      2. algebraic effects.

      On 1: I think we often conflate the benefits of Rust-style mutability-xor-aliased reference discipline with the benefits of using literal malloc and free. You can achieve the former without necessitating the latter, and I think it leads to a nicer language experience.

      It's not just true that GC "comes with latency spikes, higher memory usage, and unpredictable pauses" in any meaningful way with modern implementations of the concept. If anything, it leads to more consistent latency (no synchronous Drop of huge trees at unpredictable times) and better memory use (because good GCs use compressed pointers and compaction).

      On 2: I get non-algebraic effects for delimited continuations. But lately I've seen people using non-flow-magical effects for everything. If you need to talk to a database, pick a database interface and pass an object implementing the interface to the code that needs it. Effects do basically the same thing, but implicitly.

    • thatxliner2 hours ago
      Honestly, that's very cool

      That was basically my intent with this project, but I took the laziest way to get there lol

  • hawkice6 hours ago
    I think some comments are missing the upside of it being precisely Rust, without any new semantics. If you want lisp that compiles to machine code, Common Lisp can get reasonably efficient. The purpose of bringing Rust into it is to surface Rust-specific semantics -- which many people quite like!
    • j16sdiz6 hours ago
      [flagged]
      • hawkice5 hours ago
        Incorrect, and mean-spirited. Come on.
        • IncreasePosts4 hours ago
          For what it's worth I thought it was a nice comment and I saw no sign of AI in it
  • vermilingua6 hours ago
    Claims to have all the syntax covered, but not a single example of specifying lifetimes or the turbofish, some of the trickiest rust syntax
    • thatxliner2 hours ago
      You can also drop into direct Rust with the (rust "...") macro if I forgot to implement anything
    • kibwen5 hours ago
      If you already have the ability to express the grammar productions in Rust that allow for optionally-specified types (e.g. variable declaration), then you have the ability to express lifetimes and the turbofish (which is just a curious way to call a generic function with a specific type parameter). The only weird thing would be that Lisp uses the apostrophe character for something very different than Rust, but you could just pick any other way to denote lifetimes.
      • vermilingua5 hours ago
        Could!

        > Everything Rust has … expressed as s-expressions. No semantic gap.

    • kccqzy4 hours ago
      The HRTB is probably the trickiest syntax for specifying lifetimes. It looks like `for<'a> F: Fn(&'a (u8, u16)) -> &'a u8`.
      • stdatomic4 hours ago
        Can you translate this for those of us who don't speak rust?
        • Xirdus4 hours ago
          Type F must be a function that's generic over any possible lifetime 'a, with a single argument that's a reference with lifetime 'a to a tuple of two numbers, and returns a reference with the same lifetime 'a to an 8-bit number.

          The full code is usually something like:

          fn foo<F>(callback: F) where for<'a> F: ...

          Which is a generic function foo that takes the argument of type F, where F must be...

    • andrepd6 hours ago
      It's a vibecoded parser...
      • gleenn3 hours ago
        Technically it's a transpiler.
  • skulk4 hours ago
    So if I wanted to actually use this and I write some rust-but-lisp code and there's a compile error, will it show me a nice error message with an arrow pointing to where the error happened in my lisp code?

    Can I use the amazing `rust-analyzer` LSP to get cool IDE features?

    I suspect the answer is no, but these might be good further prompts to use.

    • thatxliner2 hours ago
      Good idea! I'm adding error messages + spans ala ariadne now
  • GalaxyNova7 hours ago
    It seems like this is more like writing Rust in an s-expression syntax instead of having a proper lisp dialect that compiles to Rust, which is cool I guess but not very interesting.

    It's quite weird-looking for someone who's done any amount of lisp programming.

    • noosphr6 hours ago
      >Rust semantics with LISP syntax. A transparent s-expression frontend that compiles directly to Rust — no runtime, no GC

      The first paragraph says literally that.

    • monocasa6 hours ago
      Yeah, it sort of reminds me of the microcode assembly of a few of the lisp machines, that, while in s-expressions were also clearly not lisp themselves. But could be an interesting target for some lisp macros.
    • shawn_w6 hours ago
      A let that defines variables that have a lifetime beyond the scope of the expression? Yeah, that's really unusual. And it's not even the oddest looking thing from the first example block of code.
  • jaggederest5 hours ago
    Unfortunately, given the clear LLM basis of this project, s-expressions aren't a great choice. I've found coding agents struggle really hard with s-expression parentheses matching.

    Much better to give them something more M-expr styled, I think a grammar that is LL(1) is probably helpful in that regard.

    Basically the more you can piggyback on the training data depth for algol-style and pythonic languages the better.

    • 5 hours ago
      undefined
    • thatxliner2 hours ago
      If anyone is curious, I've been making this using DeepSeek v4 Flash with Claude Code as the harness
    • gleenn5 hours ago
      That has definitely not been my experience as of late. I have produced multiple, largeish Clojure projects with AI that have been perfectly formatted and functional. Perhaps you were using an older or possibly smaller model? I am admittedly using Claude with higher end models and mid to high effort but it has been working great for months for me at this point.
      • jaggederest2 hours ago
        Nope, but to be fair when you're working on your own novel S-exprs you don't have LSPs to guide the coding agent. I imagine that it works a lot better in the context of a known and understood language environment like Clojure, CL, scheme, etc. The other option would be to write an LSP in a non-S-expr language to ensure that no turn can end with mismatched parens, for example.
    • dleslie5 hours ago
      Opus 4.6 handles elisp just fine. But I suppose YMMV.
    • 2ndorderthought5 hours ago
      Why are we even spending time on this. It's vibe coded slop. The creator probably never even ran it before it got to HN
  • zareithan hour ago
    Anyone working on something similar that compiles to go?
  • stevefan19993 hours ago
    Greenspun's tenth rule of programming is an aphorism in computer programming and especially programming language circles that states:[1][2]

    Any sufficiently complicated C or Fortran program contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp.

    Maybe we should one day include Golang or Rust to it

    https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule

    • kibwen3 hours ago
      Greenspun's tenth rule was formulated in a time before things like first-class functions were commonplace in industrial languages. Rust supports not just functional programming idioms but outright Scheme-style macros, it's out of scope for Greenspun's.
  • OhMeadhbh5 hours ago
    How do you change the syntax to eliminate reverse compatibility? I guess you could change the names of most key functions between releases. But to be compatible with rust you would need to make breaking changes every release.
  • stuaxo6 hours ago
    "no runtime, no GC, just" I am BEGGING every project to not have this LLMism in their docs.

    It reads as No X no Y just slop to me every time.

    • andrepd6 hours ago
      It's completely nonsensical too. Why would a parser for an alternative syntax introduce a GC?!
  • NooneAtAll32 hours ago
    does there exist something that can do the opposite?

    some pre-processor that "compiles into rust" from less awful syntax?

  • chrisweekly2 hours ago
    Should be named "Rutht"
  • amelius5 hours ago
    This is probably what Rust's internal ASTs look like. But why would you want to input programs as ASTs?
    • physPop5 hours ago
      so you can do the transformations (see the rlisp macro section)
      • amelius5 hours ago
        Yes, but you could do the same by transforming Rust's ASTs. The only downside is that your input format is different from the format you are transforming. But the upside is that readability is much improved, which matters because code is typically read far more often than it is written.
  • nxobject5 hours ago
    "Lust", or "Risp"?
    • zephen3 hours ago
      Nah.

      It's sort of, but not quite, like "El jefe"

      "L rut piss"

  • thatxliner3 hours ago
    For everyone who is shaming on the project for "not implementing enough," then you can definitely help me with it.

    For everyone who is shaming on the project for being "LLM slop," sure but that's the reason why something like this can exist in the first place. The point isn't to be a finished, production-ready product. The point is to be an interesting work, and just a sly bit silly

  • eiiot4 hours ago
    > compiles directly to Rust — no runtime, no GC, just (s-expr → .rs → binary).

    Can we please write our own READMEs before posting to HN?

  • moron4hire5 hours ago
    I don't understand why this had to be LLM generated. S-expression syntax parsers are not hard to write. That's rather much the point of S-expressions.
    • Maxatar4 hours ago
      >S-expression syntax parsers are not hard to write.

      I'm not sure I quite understand the point of your comment.

      Are you implying that LLMs should be used for very hard to write code? I feel like the best use of LLMs is to automate the easy stuff so that I can focus on the hard to write stuff.

  • slopinthebag5 hours ago
    How is pure unbridled AI slop like this making the front page? Voting rings?

    I don't even feel bad saying this because clearly OP is just the front for Claude here.

  • FrankWilhoit8 hours ago
    And for why?
    • macmac8 hours ago
      To get proper macros.
      • fao_7 hours ago
        Scheme already has hygenic macros, I don't get why you'd vibecode a worse (less battle tested, llm-generated) replacement. I'm not sure why this hit the front-page, to be honest, because it doesn't seem noteworthy or interesting (Anyone and their mother can vibecode something like this in eight hours)
        • wk_end6 hours ago
          Scheme doesn't have Rust semantics, though?
        • zem6 hours ago
          this is not a replacement for scheme, it's simply an alternative syntax for rust