msakai / cpl
An interpreter of Hagino's Categorical Programming Language (CPL).
☆119Updated 10 months ago
Alternatives and similar repositories for cpl:
Users that are interested in cpl are comparing it to the libraries listed below
- Programming library for Agda☆127Updated 7 months ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated 2 weeks ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- Library of the ##dependent distributed research support group☆112Updated 9 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Template Haskell Implementation of Egison Pattern Matching☆32Updated 4 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 3 years ago
- Fake dependent types in Haskell using singletons☆290Updated last month
- higher order dependently typed logic programing☆170Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- A compiler for functional programs on serialized data☆160Updated last week
- Benchmarks for capture-avoiding substitution☆113Updated this week
- Total Parser Combinators in Agda☆126Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆81Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆146Updated 3 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆114Updated 4 years ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- HoTT in Lean 3☆79Updated 4 years ago
- A continuation-based backtracking logic programming monad☆87Updated 5 months ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- A language based on homotopy type theory with an interval☆85Updated 10 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆213Updated last year
- The People's Refinement Logic☆229Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Extensible records, variants, structs, effects, tangles☆129Updated 4 months ago