atennapel / tinka-hsLinks
Dependently typed programming language written in Haskell
☆22Updated 3 years ago
Alternatives and similar repositories for tinka-hs
Users that are interested in tinka-hs are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- quotient types in cubical Agda☆24Updated 6 years ago
- A toy dependent typed language.☆36Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- A simple functional programming language.☆22Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated 3 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- ☆17Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago