ilyasergey / monadic-cfaLinks
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
Sorting:
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A prototype of soft contract verification for an untyped functional language☆35Updated 4 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- CLP(SMT) on top of miniKanren☆36Updated 3 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- ☆29Updated 9 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- miniKanren with a first-order representation of the search space☆16Updated 10 months ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 3 months ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 13 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- MLpolyR☆7Updated 8 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- ☆26Updated 8 years ago
- A termination checker for higher-order rewriting with dependent types☆10Updated 5 years ago
- Supporting tool for Gradual Typing☆16Updated 5 years ago
- Constructive Galois connections☆32Updated 7 years ago