ziman / lightyear
Parser combinators for Idris
☆242Updated 6 years ago
Alternatives and similar repositories for lightyear:
Users that are interested in lightyear are comparing it to the libraries listed below
- The Disco Discus Compiler☆174Updated 6 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆371Updated last year
- Fake dependent types in Haskell using singletons☆290Updated 3 weeks ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆108Updated 7 years ago
- A friendly effect system for Haskell☆231Updated 11 months ago
- Hadrian: a new build system for the Glasgow Haskell Compiler. Now merged into the GHC tree!☆207Updated 6 years ago
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆156Updated 4 years ago
- A bare-bones calculus-of-constructions☆378Updated 2 years ago
- The home of the Glamorous Glambda interpreter☆224Updated last month
- ☆291Updated 5 months ago
- Examples of Dependently-typed programs in Haskell☆304Updated 2 years ago
- Test monadic programs using state machine based models☆203Updated 3 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- A modern, extensible and well-documented prettyprinter.☆302Updated 5 months ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink☆299Updated 2 months ago
- A Idris Mode for Atom.io☆101Updated 9 months ago
- Idris for Visual Studio Code☆107Updated 2 years ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 6 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆379Updated last year
- Refinement types with static checking☆186Updated 4 months ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- A lightweight (but compatible with ‘lens’) lenses library☆292Updated last month
- Haskell JIT☆184Updated 5 years ago
- Extensional capabilities and deriving combinators☆215Updated 10 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- Convert lambda expressions to CCC combinators☆146Updated 9 years ago