The catch is that you can't actually measure the rule-and-compass construction with infinite precision. You can perform more operations on the construction and then measure later to verify that it produced the correct…
OPAM and Dune (jbuilder) work very nicely IME. You don't need to touch a Makefile, you don't need to build anything by hand outside of the package manager.
To add onto the point about expanding stacks: What's especially nice about this feature is that it means that you don't need to tune your algorithms to be tail recursive when they could be expressed more clearly as…
>It's also possible to have, say, a trillion tokens on the board and it's legal to pick any one of them as a target Even more entertaining, is the fact that (IIRC) there are certain combos that cause infinite loops that…
They are hotness because they are having trouble getting them to work (trouble = open research topic :) ), and they want to convince the monad proponents that they are better.
> I wish I had a language that did optional typing > they exist, but I don't use them. :/ The author's thoughts (I want to write dynamically to get the code working, but then make it static afterwards) are nearly the…
I don't think it's possible to create a satisfying diagram like this. It's already been said, but compartmentalizing languages into "paradigms" is generally pointless.
Hindley-Milner is cool, but if you're planning on implementing a language with type inference, I strongly suggest you take inspiration from bidirectional type inference, notably Pierce-Turner[1] and subsequently…
>Does Racket support non-Lisp-like syntax for DSLs written in it? Yes! You can override the reader so that it parses anything, and there are modules for writing grammers[1][2]. Still, it is usually much easier to just…
The catch is that you can't actually measure the rule-and-compass construction with infinite precision. You can perform more operations on the construction and then measure later to verify that it produced the correct…
OPAM and Dune (jbuilder) work very nicely IME. You don't need to touch a Makefile, you don't need to build anything by hand outside of the package manager.
To add onto the point about expanding stacks: What's especially nice about this feature is that it means that you don't need to tune your algorithms to be tail recursive when they could be expressed more clearly as…
>It's also possible to have, say, a trillion tokens on the board and it's legal to pick any one of them as a target Even more entertaining, is the fact that (IIRC) there are certain combos that cause infinite loops that…
They are hotness because they are having trouble getting them to work (trouble = open research topic :) ), and they want to convince the monad proponents that they are better.
> I wish I had a language that did optional typing > they exist, but I don't use them. :/ The author's thoughts (I want to write dynamically to get the code working, but then make it static afterwards) are nearly the…
I don't think it's possible to create a satisfying diagram like this. It's already been said, but compartmentalizing languages into "paradigms" is generally pointless.
Hindley-Milner is cool, but if you're planning on implementing a language with type inference, I strongly suggest you take inspiration from bidirectional type inference, notably Pierce-Turner[1] and subsequently…
>Does Racket support non-Lisp-like syntax for DSLs written in it? Yes! You can override the reader so that it parses anything, and there are modules for writing grammers[1][2]. Still, it is usually much easier to just…