Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages
Abstract
In paper describes the new logic programming language Delta, which have a many good properties. Delta-programs is p-computable, verifiable and can translation on other languages. Also we describe the Delta-methodology for constructing p-computable programs in high-level languages such as PHP, Java, JavaScript, C++, Pascal, Delphi, Python, Solidity and other. We would like to especially note the use of the Delta methodology for creating Smart Contracts and for Internet of things. We change the concept of the formula and define D-formulas(or Delta programs) are special list-formulas. Then we define the execution of a program how is the process of checking truth D-formula on a dynamic model. Main idea our paper consider program how list-formula from another formulas on dynamic models. And we created by iterations new Delta-programs use simple base formulas for this. Also we entered a dynamic models how models where we save final values of variables when check formula on this model.
Cite
@article{arxiv.1907.07767,
title = {Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages},
author = {Andrey Nechesov},
journal= {arXiv preprint arXiv:1907.07767},
year = {2019}
}
Comments
Delta language is a new direction in the development of the theory of semantic programming. Delta-methodology it's new way for p-computable programs on Turing complete languages. Sobolev Institute of Mathematics. Novosibirsk. Paper 9 pages