xnning / dependent-types-in-haskellLinks
Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup
☆16Updated 6 years ago
Alternatives and similar repositories for dependent-types-in-haskell
Users that are interested in dependent-types-in-haskell are comparing it to the libraries listed below
Sorting:
- Formal specification of the Haskell Language Report☆18Updated this week
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 years ago
- Zippers for cofree types☆13Updated 3 years ago
- ☆23Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Combinators for manipulating dependently-typed predicates.☆12Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- An efficient graph library for Haskell☆38Updated 2 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- ☆21Updated 7 months ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- Compiler backend for generating Scheme code☆26Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Funny little Haskell impl☆18Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago