Formalization of the computational theory of a Turing complete functional language model (Q2102949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Formalization of the computational theory of a Turing complete functional language model |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formalization of the computational theory of a Turing complete functional language model |
scientific article |
Statements
Formalization of the computational theory of a Turing complete functional language model (English)
0 references
12 December 2022
0 references
functional programming models
0 references
automating termination
0 references
computability theory
0 references
Halting problem
0 references
Rice's theorem
0 references
theorem proving
0 references
PVS
0 references
