GaloisInc / lustre
A parser and AST for Lustre
☆12Updated 3 months ago
Alternatives and similar repositories for lustre:
Users that are interested in lustre are comparing it to the libraries listed below
- ☆29Updated 9 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 9 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- Experimental functional language☆17Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Experimentation project☆16Updated 11 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Optimizing Abstract Abstract Machines☆30Updated 7 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 10 months ago
- ☆19Updated 8 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Dafny for Metatheory of Programming Languages☆24Updated last month
- Coq plugin for monomorphization and C code generation☆34Updated 2 months ago
- The Cubicle model checker☆13Updated 11 months ago
- An extended typed Lambda Calculus☆21Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 5 months ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago