ilyasergey / monadic-cfa
Generic implementation of different CFA families based on monadic decomposition
☆21Updated 12 years ago
Alternatives and similar repositories for monadic-cfa:
Users that are interested in monadic-cfa are comparing it to the libraries listed below
- miniKanren with a first-order representation of the search space☆16Updated 7 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Optimizing Abstract Abstract Machines☆30Updated 7 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- ☆29Updated 9 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- Miller/pattern unification in Agda☆64Updated 11 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- The Prettiest Printer☆35Updated last year
- Racket bindings for Z3☆19Updated 12 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- software archaeology of reflective towers of interpreters☆15Updated 5 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago