The following pages link to Mechanised Computability Theory (Q3088013):
Displaying 13 items.
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Typing total recursive functions in Coq (Q1687755) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- A Coinductive Animation of Turing Machines (Q2797865) (← links)
- Incompleteness, Undecidability and Automated Proofs (Q2829997) (← links)
- Constructive Formalization of Hybrid Logic with Eventualities (Q3100197) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
- (Q4223782) (← links)
- (Q4818803) (← links)
- Imperative process algebra and models of parallel computation (Q6580081) (← links)