BNFC / bnfc
BNF Converter
☆601Updated last month
Alternatives and similar repositories for bnfc:
Users that are interested in bnfc are comparing it to the libraries listed below
- Haskell bindings for LLVM☆518Updated 9 months ago
- CakeML: A Verified Implementation of ML☆1,023Updated this week
- Classic Algorithm W for type inference.☆253Updated 15 years ago
- Formal Reasoning About Programs☆682Updated 10 months ago
- A demo implementation of a simple dependently-typed language☆591Updated 5 months ago
- Tricks you wish the Coq manual told you [maintainer=@tchajed]☆518Updated 2 months ago
- The MLton repository☆1,007Updated last month
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,038Updated last year
- The Vellvm (Verified LLVM) coq development.☆425Updated this week
- Industrial-strength monadic parser combinator library☆941Updated 2 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆253Updated this week
- The CompCert formally-verified C compiler☆1,968Updated this week
- A work-in-progress language and compiler for verified low-level programming☆304Updated 2 weeks ago
- Minimal implementations for dependent type checking and elaboration☆657Updated 3 months ago
- Poly/ML☆498Updated 3 weeks ago
- The Ott tool for writing definitions of programming languages and calculi☆370Updated 3 months ago
- The Happy parser generator for Haskell☆301Updated 2 months ago
- Liquid Types For Haskell☆1,238Updated 3 weeks ago
- Automatic testing of Haskell programs.☆746Updated last month
- Verified Software Toolchain☆463Updated this week
- A lexical analyser generator for Haskell☆307Updated 3 weeks ago
- A monadic parser combinator library☆867Updated 3 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆610Updated 3 weeks ago
- Experimental implementation of Cubical Type Theory☆579Updated last year
- Proof assistant based on the λΠ-calculus modulo rewriting☆323Updated last week
- A fast Haskell library for parsing ByteStrings☆524Updated 4 months ago
- Shake build system☆781Updated 2 months ago
- A gently curated list of companies using verification formal methods in industry☆527Updated 2 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆378Updated last year
- A curated list of awesome Coq frameworks, libraries and software.☆234Updated 3 weeks ago