ZongzheYuan / HaltingProblemLinks
The proof of undecidability of halting problem, using the model -- WHILE language.
☆21Updated 5 years ago
Alternatives and similar repositories for HaltingProblem
Users that are interested in HaltingProblem are comparing it to the libraries listed below
Sorting:
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- An implementation of Functional Reactive Programming☆41Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Porting of software foundations book to Agda☆39Updated 11 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Where my everyday research happens☆55Updated last week
- Formalizing nbe in agda☆32Updated 13 years ago
- Category theory and algebra☆26Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Updated 7 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆45Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- ☆31Updated 11 years ago
- ☆85Updated 8 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago