3 ms·
Haskell compiled with GHC is one example. And the sister comment mentions certain Scheme/Racket implementations. Something like Datalog wouldn't really have a
by eru 5y ago
Haskell compiled with GHC is one example. And the sister comment mentions certain Scheme/Racket implementations.
Something like Datalog wouldn't really have a call stack either, but that's deliberately not a Turing complete language. (But neither is Agda a Turing complete language, but it's still general purpose.)