geisha-lang / GeishaLinks
A naive θ..θ programming language
☆27Updated 7 years ago
Alternatives and similar repositories for Geisha
Users that are interested in Geisha are comparing it to the libraries listed below
Sorting:
- Ask for solutions.☆19Updated 6 years ago
- The MLPolyR programming language, revived☆25Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Higher-order optimization library☆76Updated 2 years ago
- Sucessor: https://github.com/thautwarm/Quick-Backend☆24Updated 5 years ago
- A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).☆16Updated 3 weeks ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated this week
- Towards changing things and see if it proofs☆60Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- ☆26Updated 8 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- xmonad in Coq☆46Updated 13 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Updated 7 years ago
- Specification of Agda.☆25Updated 6 years ago
- mirror of A simple type-theoretic language: Mini-TT☆41Updated 8 years ago
- An enhanced unification algorithm for Coq☆58Updated this week
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Constructive Interpretations of HoTT☆36Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Updated 9 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago