Formalization of the Computational Theory of a Turing Complete Functional Language Model

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. The model is built over basic operators, which, when restricted to constants, successor, projections, greater-than, and bijections from tuples...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of automated reasoning Vol. 66; no. 4; pp. 1031 - 1063
Main Authors:	Ramos, Thiago Mendonça Ferreira, Almeida, Ariane Alves, Ayala-Rincón, Mauricio
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.11.2022 Springer Nature B.V
Subjects:	Artificial Intelligence Automation Computer Science Fixed points (mathematics) Grammar Language Mathematical Logic and Formal Languages Mathematical Logic and Foundations Recursive functions Semantics Symbolic and Algebraic Manipulation Theorems Automating termination Computability theory Halting Problem Theorem proving Functional programming models PVS Rice’s Theorem
ISSN:	0168-7433, 1573-0670
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!