ucsd-progsys / liquid-fixpoint
Horn Clause Constraint Solving for Liquid Types
☆141Updated this week
Related projects ⓘ
Alternatives and complementary repositories for liquid-fixpoint
- being an operating system for typechecking processes☆121Updated last year
- Convert Haskell source code to Coq source code.☆78Updated 2 months ago
- Total Parser Combinators in Agda☆123Updated last year
- Compiling Agda code to readable Haskell☆177Updated last month
- Language Server for Agda☆102Updated 2 weeks ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Fast parsing from bytestrings☆149Updated last week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- A core language and API for dependently typed languages☆89Updated 11 months ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A compiler for functional programs on serialized data☆158Updated this week
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆57Updated 8 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- SPLV20 course notes☆106Updated 2 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- GRIN backend for GHC☆143Updated 3 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆76Updated 7 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 2 years ago
- A small implementation of higher-order unification☆182Updated 7 years ago
- Fake dependent types in Haskell using singletons☆287Updated 3 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Organization and planning for the Initial Types Club☆71Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago