ZongzheYuan / HaltingProblem
The proof of undecidability of halting problem, using the model -- WHILE language.
☆20Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for HaltingProblem
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 6 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- Where my everyday research happens☆53Updated last week
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- Category theory and algebra☆27Updated 8 years ago
- Logical relations proof in Agda☆24Updated 9 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- ☆19Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- The Prettiest Printer☆35Updated 9 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 7 years ago
- xmonad in Coq☆43Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Base library for HoTT in Agda☆36Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- System F in coq.☆19Updated 9 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago