marcelgoh / opythn
A compiler and bytecode interpreter for a subset of Python
☆10Updated 4 years ago
Alternatives and similar repositories for opythn
Users that are interested in opythn are comparing it to the libraries listed below
Sorting:
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆53Updated 8 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated last month
- Coq library on rewriting theory and termination☆36Updated 2 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 3 weeks ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- 🦠 Reusable components based on algebraic effects☆50Updated 7 months ago
- A verified compiler for a lazy functional language☆35Updated this week
- ☆21Updated 4 years ago
- Efficient binder representation in OCaml☆42Updated 10 months ago
- Yet Another deep embedding of Linear Logic in Coq☆15Updated last month
- Mechanizations of Type Theories☆28Updated 2 months ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago
- A TACtic library for Agda☆48Updated 8 months ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆27Updated this week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 6 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- ☆23Updated 10 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated this week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago