ZongzheYuan / HaltingProblem
The proof of undecidability of halting problem, using the model -- WHILE language.
☆20Updated 4 years ago
Alternatives and similar repositories for HaltingProblem:
Users that are interested in HaltingProblem are comparing it to the libraries listed below
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- Category theory and algebra☆28Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Base library for HoTT in Agda☆37Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- An implementation of Functional Reactive Programming☆40Updated 9 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 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
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Updated 6 years ago
- ☆30Updated 10 years ago
- Where my everyday research happens☆52Updated last week
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- ☆17Updated 2 years ago