TyGuS / hoogle_plusLinks
Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
☆60Updated 2 weeks ago
Alternatives and similar repositories for hoogle_plus
Users that are interested in hoogle_plus are comparing it to the libraries listed below
Sorting:
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 6 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Fast equality saturation in Haskell☆86Updated 3 weeks ago
- Horn Clause Constraint Solving for Liquid Types☆150Updated last week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- SPLV20 course notes☆112Updated 2 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- The Software Foundations book, in GHC☆83Updated 7 months ago
- ICFP tutorial☆39Updated 4 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- GHC Whole Program Compiler and External STG IR tooling☆118Updated 8 months ago
- Paper and talk☆54Updated 2 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Haskell embedding of PlusCal☆61Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week