norm2782 / NanoPrologLinks
☆17Updated 2 years ago
Alternatives and similar repositories for NanoProlog
Users that are interested in NanoProlog are comparing it to the libraries listed below
Sorting:
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- ☆23Updated 7 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- Educational implementation of dependent types☆19Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Types representing line and column positions and ranges in text files☆11Updated 2 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Invertible parsing for S-expressions☆34Updated 2 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 8 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- The Hadrian build system for GHC☆9Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated 8 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Experiments with linear types☆14Updated 7 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago