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:
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 weeks ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 months ago
- NbE course @ Chalmers☆28Updated 9 months ago
- ☆21Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- A TACtic library for Agda☆48Updated 10 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A work-in-progress core language for Agda, in Agda☆54Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- A place to collect work on dialectica categories.☆26Updated last week
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A library for doing generic programming in Agda☆32Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Formalizing nbe in agda☆31Updated 12 years ago