pigworker / MS4P
being some thoughts about introductory mathematics for computer science
☆15Updated 5 months ago
Alternatives and similar repositories for MS4P:
Users that are interested in MS4P are comparing it to the libraries listed below
- A compiler that translates a form of lambda calculus to C☆12Updated 8 months ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- NbE course @ Chalmers☆28Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆26Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- Mechanizations of Type Theories☆28Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 5 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 10 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- Anders: Cubical Type Checker☆18Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 11 months ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆29Updated 3 months ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆29Updated this week
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- ☆24Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆22Updated last month
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- ☆22Updated 4 months ago
- ☆47Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated this week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated last year