csabahruska / p4f-control-flow-analysisLinks
Haskell implementation of P4F Control-Flow Analysis
☆21Updated 3 years ago
Alternatives and similar repositories for p4f-control-flow-analysis
Users that are interested in p4f-control-flow-analysis are comparing it to the libraries listed below
Sorting:
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Updated 9 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- NbE course @ Chalmers☆28Updated 9 months ago
- A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).☆16Updated 4 months ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experimentation project☆16Updated 11 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Specification of Agda.☆25Updated 6 years ago
- Type inference for 'type level computation one step at a time'☆13Updated 7 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆26Updated 8 years ago
- ☆23Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- ICFP tutorial☆39Updated 3 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago