Pages that link to "Item:Q2102949"
From MaRDI portal
The following pages link to Formalization of the computational theory of a Turing complete functional language model (Q2102949):
Displaying 5 items.
- Computational and attribute models of formal languages (Q912638) (← links)
- Formalization of the undecidability of the halting problem for a functional language (Q1799282) (← links)
- Formalizing abstract computability: Turing categories in Coq (Q2333325) (← links)
- A language for easy and efficient modeling of Turing machines (Q2478283) (← links)
- Formal verification of termination criteria for first-order recursive functions (Q6149593) (← links)