mroman42 / ctlc
(λ) Category theory and lambda calculus, Bachelor's thesis
☆39Updated 6 years ago
Alternatives and similar repositories for ctlc:
Users that are interested in ctlc are comparing it to the libraries listed below
- (λ) Educational lambda calculus interpreter☆72Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- ☆40Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆84Updated last year
- The Agda Universal Algebra Library (html docs available at the url below)☆31Updated 2 months ago
- A verified compiler for a lazy functional language☆34Updated last week
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 4 months ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 3 months ago
- Ground Zero: Lean 4 HoTT Library☆52Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago