a proposal for #deterministic computation on #ipfs
on 02016-04-23"Morte" is a low-level language built on top of #Haskell for #deterministic computation, but with the purpose of its performance being “immune to abstractions” through its guarantee that “if two programs are equal [according to equational reasoning] then they generate identical executables.” It claims to be a bare-bones implementation of the calculus of constructions. It sounds like it will produce impractically large and slow programs and be unusable to program in, and it can guarantee termination (so it’s not Turing-complete), but it seems like an important theoretical result. Also there’s a prototype high-level language built on top of it called #Annah.
on 02016-04-23