Pages that link to "Item:Q1687735"
From MaRDI portal
The following pages link to Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735):
Displaying 8 items.
- The weak lambda calculus as a reasonable machine (Q930866) (← 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)
- The \textsc{MetaCoq} project (Q2209542) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Formalizing abstract computability: Turing categories in Coq (Q2333325) (← links)
- Hilbert's Tenth Problem in Coq (Q5089029) (← links)
- (Q5094119) (← links)