YouyouCong / counterpointLinks
☆11Updated 2 years ago
Alternatives and similar repositories for counterpoint
Users that are interested in counterpoint are comparing it to the libraries listed below
Sorting:
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- Lecture notes on realizability☆75Updated 11 months ago
- A tutorial on how Agda infers things☆64Updated 7 months ago
- Horn Clause Constraint Solving for Liquid Types☆157Updated 2 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆64Updated 6 months ago
- Parser Combinator Library for Lean 4☆75Updated last week
- Agda bindings to SMT-LIB2 compatible solvers.☆104Updated 5 months ago
- An interpreter of Hagino's Categorical Programming Language (CPL).☆126Updated this week
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A simple dependently typed language based on the Calculus of Constructions.☆19Updated 5 years ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- being an operating system for typechecking processes☆131Updated 4 months ago
- Implementation of the Delta Language☆13Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Introduction to algebraic effects and handlers☆100Updated 7 years ago
- A work-in-progress core language for Agda, in Agda☆64Updated this week
- Course on Metaprogramming☆75Updated this week
- The Penn Locally Nameless Metatheory Library☆75Updated 10 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- a proof-of-concept programming language based on call-by-push-value☆61Updated 3 weeks ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago