lkuper / lvar-examplesLinks
Programming with LVars, by example
☆36Updated 10 years ago
Alternatives and similar repositories for lvar-examples
Users that are interested in lvar-examples are comparing it to the libraries listed below
Sorting:
- System POSIX bindings for Idris.☆36Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Dealing with Flags and Options☆13Updated 3 years ago
- The LVish Haskell library☆80Updated 2 years ago
- Accepted papers for ICFP 2014☆119Updated 9 years ago
- Morte IDE☆29Updated 5 months ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- machine fusion☆16Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- The generalized intensional compiler for a Haskell-like language.☆14Updated 7 years ago
- An OS written in Idris (eventually...)☆20Updated 10 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Yet Another Software Language Repository☆19Updated 3 years ago
- A Haskell-only implementation of zlib / DEFLATE.☆31Updated 3 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- ☆23Updated 7 years ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Updated 10 months ago
- A Haskell implementation of "Functional pearl: a SQL to C compiler in 500 lines of code"☆46Updated 6 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Updated 9 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- ☆29Updated 9 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 4 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago