register-machine-typelevel: A computationally universal register machine implementation at the type-level
Computationally universal register machine implementation at the type-level.
This formulation is identical to the Lambek
machine, with the addition
of an explicit
Halt instruction, for convenience.
This means (or rather, this is made possible by the fact) that that
Haskell's type system is Turing complete (at least with
TypeFamilies and UndecidableInstances).
[Skip to Readme]
|Dependencies||base (>=4.8 && <=4.9) [details]|
|Source repo||head: git clone https://github.com/kcsongor/register-machine-type|
|Uploaded||by kcsongor at 2016-04-04T23:01:31Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||782 total (0 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2016-04-04 [all 1 reports]