minipascal VS pie

For a simple, but real language example, check: https://github.com/soegaard/minipascal

Here are some more benchmarks from UCSD Pascal: https://github.com/soegaard/minipascal/blob/master/minipascal/tests-real/primes.rkt This was using a bytecode interpreter, but that would have been heavily optimised for each platform so it's probably a reasonably idiomatically program. The interesting thing here is that both the Z80 and the 6502 will beat the 8088 for any given clock speed...

> Eventually I'll probably implement a Pascal layer on top of Racket.

https://github.com/soegaard/minipascal

Pie, a dependently typed language for learning dependently typed programming

The computer scientists who are figuring these things out are constructing the tools that software engineers need; just like the mathematicians who developed calculus and the physicists who extended Newtonian mechanics into something engineers can apply. Just as an engineer's tools and materials are calculus and physics (not hammers or concrete and steel), a software engineer's tools and materials are proof-assistants, category theory, linear polarized logic, and dependent type theory (not the Rust programming language or the UNIX platform).

That's basically this[0] book, is it not?

[0] https://thelittletyper.com

I really should read https://thelittletyper.com/

It lets you create languages like Pie which is designed to teach others about dependent types:

https://thelittletyper.com/

Yep, this is one possibility - an example is the language pie from the book The Little Typer. But my claim was not that there are no expressions for types, just that declarations aren't expressions.