Mathstodon

0 posts0 participants0 posts today

Artyom BologovAcknowledging that I'm lazy on a work seminar might've been a mistake, but I did it. And now I'm writing a post on the most laziest <a href="https://merveilles.town/tags/ProgrammingLanguage" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#ProgrammingLanguage</a> design case ever. Using <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a>, of course:<a href="https://github.com/aartaka/lamber" rel="nofollow noopener noreferrer" translate="no" target="_blank">https://github.com/aartaka/lamber</a>

Artyom BologovIn the spirit of (not-that-radical, unfortunately) openness (inspired by none other than <a href="https://mas.to/@TodePond" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@TodePond</a>,) let me share a thing I've been quietly working on for the last couple of months: <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a>, my pure <a href="https://merveilles.town/tags/LambdaCalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#LambdaCalculus</a> -compiling <a href="https://merveilles.town/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#FunctionalProgramming</a> language inspired by <a href="https://merveilles.town/tags/Lua" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lua</a> and <a href="https://merveilles.town/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#haskell</a> <a href="https://github.com/aartaka/lamber" rel="nofollow noopener noreferrer" translate="no" target="_blank">https://github.com/aartaka/lamber</a><a href="https://merveilles.town/tags/theWorkshop" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#theWorkshop</a>

Artyom BologovI want to use <a href="https://merveilles.town/tags/ed" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#ed</a> more, but me being a Lisper is a huge obstacle to that. <a href="https://merveilles.town/tags/Lisp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lisp</a> ASTs and line-based editing don't play well together. And it's a pain to balance the parens in ed. I have already amassed a bunch of regex scripts for doing Lisp, but it's clearly not enough.Sigh. I want to write something that isn't C or <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a> in <a href="https://merveilles.town/tags/ed" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#ed</a>, but I have to come up with a lot of tools and hacks for that.

Artyom BologovI think my idea of a simple type system for <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a> is coming together: - We have primitive/nominal/tag types, like int, char, bool. - We have structure/record/tuple/constructed types that consist of N types. - We have function types that accept args of some type each and return a value of some type. - Function types and structute types can and are recursive. They can include other types.An important property of structure types is that their members are named by accessors (which rarely is a problem, right?) So hypothetic cons type is:def cons = type (car cdr) fn (f) f car cdr .This way, we ensure that there are accessor functions, car and cdr, and that they return properly typed values. E.g., we can infer that for "let x = cons 1 true", "car x" will return an int, while "cdr x" will return a bool.I've done it this way because I want a syntactically simple type system that works. A property I want to retain is never having to declare function types explicitly, only relying on type annotations/constructors inside of them to infer the types.I'm still thinking on whether this is a good solution, but it seems to strike a perfect balance between conceptual simplicity and the amount of implementation magic required for it.<a href="https://merveilles.town/tags/theWorkshop" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#theWorkshop</a>

Artyom Bologov<a href="https://merveilles.town/tags/TIL" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#TIL</a> that there's a <a href="https://merveilles.town/tags/LambdaCalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#LambdaCalculus</a> based language called brujin (for obvious reasons) and that it's absolutely unreadable! The standard library and the amount of work that went into it is extremely impressive though, so go give it a read:<a href="https://bruijn.marvinborner.de/" rel="nofollow noopener noreferrer" translate="no" target="_blank">https://bruijn.marvinborner.de/</a>and show some love to Marvin Borner, the creator of brujin!I'm stealing parts of it (like Maybe monad) into <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a>, my own applicative <a href="https://merveilles.town/tags/LambdaCalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#LambdaCalculus</a> compiling <a href="https://merveilles.town/tags/Lua" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lua</a> like language.<a href="https://merveilles.town/tags/theWorkshop" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#theWorkshop</a> <a href="https://merveilles.town/tags/theLibrary" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#theLibrary</a>

Artyom BologovSo I compiled a proper standard library for <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a>, taking all functions from <a href="https://github.com/aartaka/stdlambda" rel="nofollow noopener noreferrer" translate="no" target="_blank">https://github.com/aartaka/stdlambda</a> and translating them to a much more readable syntax!What's left is making a proper front-end/CLI, and the language is ready for open sourcing!I can add much more to it, but that's a minimum. The wishlist for more is: - Infix operations. - Type checking and inference. - Record types. - State/IO operations. - Interfacing with underlying platform (Common Lisp) and reusing its functions. - Optimization passes based on the above. - More implementations!

Artyom BologovY'all, how readable does this piece of code seem to you?def div = fn (numer denom) local loop = fn quot when lt quot denom then 0 else : succ : loop : sub quot denom end loop numer endThat's division via subtraction from <a href="https://merveilles.town/tags/Lamber" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#Lamber</a> standard library. And yes, it parses, compiles to pure <a href="https://merveilles.town/tags/LambdaCalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#LambdaCalculus</a> and returns the right number when applied properly!<a href="https://merveilles.town/tags/theWorkshop" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#theWorkshop</a>

Recent searches

Search options

Administered by:

Server stats:

#lamber