geisha-lang / Geisha
A naive θ..θ programming language
☆27Updated 6 years ago
Alternatives and similar repositories for Geisha:
Users that are interested in Geisha are comparing it to the libraries listed below
- The MLPolyR programming language, revived☆24Updated 4 years ago
- Type inference for 'type level computation one step at a time'☆12Updated 7 years ago
- ☆11Updated 3 years ago
- An implementation of a Zeilberger-style linear type theory.☆10Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Ask for solutions.☆19Updated 5 years ago
- Higher-order optimization library☆73Updated last year
- Constructive Interpretations of HoTT☆36Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).☆16Updated 10 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Stand-alone command-line version of the pointful plugin for Lambdabot.☆26Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Specification of Agda.☆25Updated 6 years ago
- Implementing grep in Agda☆32Updated 4 years ago
- A Dict k v in Idris☆15Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Lean4 backend using `libgccjit`!☆11Updated last year
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆30Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- ☆26Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆13Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago