ucsd-progsys / liquid-fixpointLinks
Horn Clause Constraint Solving for Liquid Types
☆155Updated last week
Alternatives and similar repositories for liquid-fixpoint
Users that are interested in liquid-fixpoint are comparing it to the libraries listed below
Sorting:
- Total Parser Combinators in Agda☆132Updated 4 months ago
- being an operating system for typechecking processes☆130Updated last month
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- A core language and API for dependently typed languages☆96Updated 9 months ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 4 months ago
- Language Server for Agda☆120Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Compiling Agda code to readable Haskell☆195Updated last week
- A compiler for functional programs on serialized data☆173Updated this week
- 😎TT☆234Updated 2 weeks ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Convert Haskell source code to Coq source code.☆93Updated 5 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 3 months ago
- Build system☆131Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 3 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Programming library for Agda☆133Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- An interactive theorem prover based on lambda-tree syntax☆97Updated last week
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 2 months ago