jtkristensen / JeopardyLinks
The official interpreter for the Jeopardy language
☆16Updated 2 years ago
Alternatives and similar repositories for Jeopardy
Users that are interested in Jeopardy are comparing it to the libraries listed below
Sorting:
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- A TACtic library for Agda☆49Updated 10 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Where my everyday research happens☆54Updated 2 months ago
- NbE course @ Chalmers☆28Updated 10 months ago
- Paper and talk☆54Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last week