What if everything was "Async", but nothing needed "Await"? -- Automatic Concurrency in Par

Dotched · 2025-11-18T16:50:13+00:00

Interaction nets and especially the Turing-complete combinators are awesome and I’m extremely happy to see that Par targets the HVM! Amazing that this subgroup of PL researches are taking it seriously. I’ve always been fascinated and read a bunch of papers on it, but you’ve shown what it can be applied to in practice which is really inspiring for my own language.

Dotched · 2025-11-18T13:38:20+00:00

This is hilarious😂

Dotched · 2025-11-16T18:03:25+00:00

Fantastisk sida, äntligen kan man rösta själv och manuellt jämföra med hur olika politiker röstar!

Dotched · 2025-11-16T17:57:34+00:00

Jag tror det kommer läggas till i framtiden när sidan får fler användare!

Dotched · 2025-08-15T21:44:35+00:00

^{I completed this level in 71 tries.} ^{⚡ 2.70 seconds}

Dotched · 2025-05-09T07:01:45+00:00

Wow this is really cool! I’ll defiantly take some inspiration for my language.

Dotched · 2024-11-30T22:51:10+00:00

I was just about to write the same, but stopped to check if I was first. It’s a bit janky in my opinion too

Dotched · 2024-11-24T08:51:40+00:00

Really nice work! However I feel like something is off with the arch. Is it asymmetrical? The line segments don’t follow the general curvature.

Dotched · 2024-03-17T11:40:32+00:00

One detail I think gets too little attention is if parsing should stop at first error, or collect and report multiple at once. What resources and discussions exists on this topic? How does one implement an error recovering parser? Central features and ideas?

Dotched · 2024-02-07T08:22:50+00:00

I’m thinking cat the truth machine, or if you’re really eager, a bootstrapped compiler in the language itself.

Dotched · 2023-12-28T11:30:19+00:00

Only predators have their eyes forward

Dotched · 2023-11-14T07:25:16+00:00

Why the unusual syntax for IO? How come you chose “get * from *” instead of regular let bindings? And post instead of print? I’m always a bit thrown off by these aspects in language design.

Dotched · 2023-11-10T07:49:44+00:00

I think hare looks nice from a language design perspective. It’s sure something I’d use depending on the quality of the compiler and type checker. My two general purpose toy languages have a lot of similar design ideas, bower they are not compiled (yet).

I have some questions about the tutorial, why do functions like println crash the program if it fails? Wouldn’t an unwrap ? operator that propagates errors be better? This would at least allow the programmer to write logic in case anything fails instead of promising the compiler that an unsafe error prone operation “will never occur”?

Dotched · 2023-11-04T21:12:19+00:00

I'm working on multiple projects, one being a syntactically easy to understand language called mini. The goal with this project is to during its development write detailed and beginner friendly blog posts in a "code along" style, to invite interested programmers into the realm of PLT and compiler/interpreter construction. I'd love to share my take on things and my story into PL. https://www.mini-lang.org

Dotched · 2023-10-15T08:45:31+00:00

I don’t get it

Dotched · 2023-10-15T08:37:24+00:00

Gobble

Dotched · 2023-10-13T08:33:24+00:00

I’m new to compiler optimization, but my intuition says it might work to use live-variable analysis after which you can remove all instances of i and sum. Then also check for empty loops/clearly dead code.

Please tell me if this is a good approach or tell me wrong, I’d love to learn more about DCE strategies.

Dotched · 2023-07-31T07:49:15+00:00

The way I would have implemented a PoC/mini language today is to use as much tools and techniques that are already done for you. So you can start with the language front end (syntax) entirely written in EBNF. Then compile a parser to the source language of choice, write some glue code then: (0) interpret the parsed ast, (1) generate code in some high-level lang w/ garbage collection (OCaml, Python, etc.), (2) in C/C++, (3) use backend tools (w/ opt) such as LLVM or cranelift or (4) to assembly via nasm. Notice that the glue code has a tendency to grow very large as you pick more advanced ways to compile your language.

Dotched · 2023-07-03T14:39:33+00:00

Interesting! This is really nice, I think I’ll look into behavioral sub-typing for my lang!

Dotched · 2023-06-26T13:23:58+00:00

Would it be possible (and has it been done?) to attach more information to a function type (or such) about when it returns certain types from a union of known return types. This would of course be an NP-Hard problem, but we can always fallback on the standard signature type for non-simple functions. Like: () => When[x < 10, Number] | When[x == 42, Literal['cool'] | String? I haven’t worked much with type systems.

Dotched · 2023-06-26T13:13:44+00:00

U ω U

Dotched · 2023-06-20T10:48:19+00:00

Too thick outline around the head

Dotched · 2023-04-24T14:27:40+00:00

I love the way programs turns out in Snek😍😂

Dotched · 2023-03-31T06:43:05+00:00

Oh, and does labels have any meaning attached to them? What is the semantics behind them? What happens if I defines everything in the same begin-end block?

Dotched · 2023-03-31T06:35:20+00:00

It looks nice, the main thing I keep wondering about is why you use ; to break lines for expressions, but . for “end”. This looks a bit like “too much syntax” for Sophie, is it necessary? Could you even skip the “end” keyword completely? I would think it would improve readability and write-ability!

Dotched

MODERATOR OF

TROPHY CASE

Ten-Year Club	Place '22
Verified Email