Search Results - abstract and automation computability and recursion theory~
-
1
Grammar semantics, analysis and parsing by abstract interpretation
ISSN: 0304-3975, 1879-2294Published: Oxford Elsevier B.V 14.10.2011Published in Theoretical computer science (14.10.2011)“…We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata…”
Get full text
Journal Article -
2
Formalization of the Computational Theory of a Turing Complete Functional Language Model
ISSN: 0168-7433, 1573-0670Published: Dordrecht Springer Netherlands 01.11.2022Published in Journal of automated reasoning (01.11.2022)“…This work presents a formalization in PVS of the computational theory for a computational model given as a class of partial recursive functions called PVS0…”
Get full text
Journal Article -
3
On Safety of Unary and Nonunary IFP Operators
ISSN: 0146-4116, 1558-108XPublished: Moscow Pleiades Publishing 01.12.2019Published in Automatic control and computer sciences (01.12.2019)“… Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g…”
Get full text
Journal Article