jtkristensen / JeopardyLinks
The official interpreter for the Jeopardy language
☆16Updated 3 years ago
Alternatives and similar repositories for Jeopardy
Users that are interested in Jeopardy are comparing it to the libraries listed below
Sorting:
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- A TACtic library for Agda☆51Updated last year
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- Where my everyday research happens☆56Updated this week
- being a thing I build on a Saturday☆28Updated 7 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The Prettiest Printer☆35Updated last year
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Unification and type inference algorithms☆127Updated 10 years ago