An Abstract Machine
I seem to have one. Here's the OCaml signature. The module file is all of 250 lines at this point, but I expect to define a lot of built-in processes for the preamble. That will bloat out the module file.
type 'a t
module Op: sig
val ( >>= ): 'a t -> ('a -> 'b t) -> 'b t
endval return: 'a -> 'a t
val eval: unit t -> unittype n
type repeat = Once | Alwaysval nil: unit t
val start: unit t -> unit t
val lambda: n t
val nu: n t
val fusion: n -> repeat -> n list -> unit t -> unit tval v_void: n
val v_true: n
val v_false: nval if_then_else: n -> unit t -> unit t -> unit t
type dio = D_in | D_out
val def: dio list -> (n array -> unit t) -> n tval preamble: n Name.Map.t t
Basically, the abstract machine is a monad. I'll compile programs into an abstract syntax tree, then when the tree is pruned until it conforms to all the syntax and semantics invariants, I'll visit the nodes to compose a monad value. I'll execute the program by evaluating the monad. To say that it will not be fast is an understatement of Brobdingagian proportions. It will be simulating concurrency in a single thread of control, which will seem like a wide miss of the whole point. It will, however, allow me to experiment with higher-level language syntax and semantics for a while before I hit the next wall, where I expect I will need to write a byte code interpreter in C with POSIX threads to make further progress.
My Groups
-
Amnesty International Updated: 48 minutes ago
-
Writers Hub Updated: 14 hours ago
Neighborhood
Explore friends, family, friends & family, or entire neighborhood.
