batterseapower / chscLinks
The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"
☆23Updated 14 years ago
Alternatives and similar repositories for chsc
Users that are interested in chsc are comparing it to the libraries listed below
Sorting:
- Agda to C compiler☆10Updated 2 years ago
- Formal specification of the Haskell Language Report☆25Updated this week
- Compiler backend for generating Scheme code☆26Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- ☆12Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 weeks ago
- ☆16Updated 3 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago