BNFC / bnfc
BNF Converter
☆598Updated 2 weeks ago
Alternatives and similar repositories for bnfc:
Users that are interested in bnfc are comparing it to the libraries listed below
- A demo implementation of a simple dependently-typed language☆591Updated 4 months ago
- Liquid Types For Haskell☆1,231Updated this week
- Haskell bindings for LLVM☆518Updated 8 months ago
- A lexical analyser generator for Haskell☆306Updated 2 weeks ago
- CakeML: A Verified Implementation of ML☆1,012Updated this week
- Algebraic graphs☆737Updated 10 months ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆370Updated last year
- The MLton repository☆1,001Updated last month
- Industrial-strength monadic parser combinator library☆941Updated 2 months ago
- Formal Reasoning About Programs☆682Updated 9 months ago
- Tricks you wish the Coq manual told you [maintainer=@tchajed]☆515Updated last month
- Functional programming with fewer indirections☆760Updated 4 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,038Updated last year
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆253Updated this week
- Minimal implementations for dependent type checking and elaboration☆652Updated 2 months ago
- Spartan type theory☆262Updated 10 months ago
- The Happy parser generator for Haskell☆301Updated last month
- The Ott tool for writing definitions of programming languages and calculi☆367Updated 3 months ago
- A monadic parser combinator library☆865Updated 3 months ago
- The Agda standard library☆607Updated this week
- A work-in-progress language and compiler for verified low-level programming☆303Updated 3 weeks ago
- Experimental implementation of Cubical Type Theory☆579Updated last year
- The HOL Light theorem prover☆451Updated 2 weeks ago
- Shake build system☆780Updated 2 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆608Updated last month
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆375Updated last year
- Proof assistant based on the λΠ-calculus modulo rewriting☆315Updated last week
- Poly/ML☆497Updated last week
- Classic Algorithm W for type inference.☆254Updated 15 years ago
- Software Foundations in Idris☆455Updated 5 years ago