hackage.haskell.org : register-machine-typelevel
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).
Registry
-
Source
- JSON
- codemeta.json
purl: pkg:hackage/register-machine-typelevel
Keywords:
bsd3
, language
, library
, Propose Tags
License: BSD-3-Clause
Latest release: almost 10 years ago
First release: almost 10 years ago
Downloads: 851 total
Stars: 23 on GitHub
Forks: 2 on GitHub
See more repository details: repos.ecosyste.ms
Funding links: https://github.com/sponsors/kcsongor
Last synced: 5 days ago