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
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- quotient types in cubical Agda☆24Updated 6 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A simple functional programming language.☆22Updated 4 years ago
- a self-hosting lambda calculus compiler☆37Updated 8 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Formalization of type theory☆22Updated 4 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
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated 10 months ago