Forth implemented in Rust trait system
github.com
Forth implemented in Rust trait system
1–10 of 91 posts
Re: Forth implemented in Rust trait system
#2Finally, Rust is production-ready.
It is neat to see something more practical than an Brainf* interpreter.
Re: Forth implemented in Rust trait system
#3> Rust's trait system is Turing complete
has anyone tried implementing rust in rust's trait system
Re: Forth implemented in Rust trait system
#4I don't see why people won't just take the step D and Lisp do-- allowing full use of the programming language at compile time.
You can execute an ordinary functions at compile-time to read a DSL from a string or read attributes (reflective metaprogramming) on your program's classes. Take the string it outputs, use mixin(), and you have code. For example:
// Sort a constant declaration at Compile-Time
enum a = [ 3, 1, 2, 4, 0 ];
static immutable b = sort(a);
Re: Forth implemented in Rust trait system
#5This is brilliant! Equivalent, in its way, to C++ template metaprogramming. It was cheeky to do a Forth instead of an ML. The traditional way to demonstrate TC is by sieving primes at compile time.
C++ is actively replacing its compile-time ML with core language features, but isn't there yet. Still, it has been many years since I needed to code any of my own TMP.
Re: Forth implemented in Rust trait system
#6I don't see why people won't just take the step D and Lisp do-- allowing full use of the programming language at compile time. You can execute an ordinary functions at compile-time to read a DSL from a string or read attributes (reflective metaprogramming) on your program's classes. Take the string it outputs, use mixin(), and you have code. For example: // Sort a constant declaration at Compile-Time enum a = [ 3, 1,…
Zig takes this approach. I haven't done more than kick the tires curiously, but it seems very cool.
Re: Forth implemented in Rust trait system
#7I don't see why people won't just take the step D and Lisp do-- allowing full use of the programming language at compile time. You can execute an ordinary functions at compile-time to read a DSL from a string or read attributes (reflective metaprogramming) on your program's classes. Take the string it outputs, use mixin(), and you have code. For example: // Sort a constant declaration at Compile-Time enum a = [ 3, 1,…
Doesn’t the compiler already do optimizations like that?
Re: Forth implemented in Rust trait system
#8This is a pretty superficial treatment of Forth. It's more of a simple RPN calculator than a Forth.
Re: Forth implemented in Rust trait system
#9I don't see why people won't just take the step D and Lisp do-- allowing full use of the programming language at compile time. You can execute an ordinary functions at compile-time to read a DSL from a string or read attributes (reflective metaprogramming) on your program's classes. Take the string it outputs, use mixin(), and you have code. For example: // Sort a constant declaration at Compile-Time enum a = [ 3, 1,…
The most useful values at compile time are types, so straight-up interpreting the core language at compile time is not enough. You need meta-typed named values to transport types in, and meta-functions to pass them to.
Fortraith cleverly re-purposes existing features, doing some violence to language usage conventions to achieve it.
Re: Forth implemented in Rust trait system
#10This is brilliant! Equivalent, in its way, to C++ template metaprogramming. It was cheeky to do a Forth instead of an ML. The traditional way to demonstrate TC is by sieving primes at compile time. C++ is actively replacing its compile-time ML with core language features, but isn't there yet. Still, it has been many years since I needed to code any of my own TMP.
Sort of, arithmetic is implemented (through the trait-eval crate) from the Peano axioms. Probably it is not very fast, even in comparison to C++ standards.