Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages

07/12/2019
by   Andrey Nechesov, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2019

Semantic programming: method Δ_0^p-enrichments and polynomial computable fixed points

Computer programs fast entered in our live and the questions associated ...
research
04/16/2021

{log}: Set Formulas as Programs

{log} is a programming language at the intersection of Constraint Logic ...
research
07/09/2017

Generation and analysis of lamplighter programs

We consider a programming language based on the lamplighter group that u...
research
01/02/2018

Scilla: a Smart Contract Intermediate-Level LAnguage

This paper outlines key design principles of Scilla---an intermediate-le...
research
12/01/2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Canonical (logic) programs (CP) refer to normal logic programs augmented...
research
12/22/2021

Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity

Motivated by algorithmic information theory, the problem of program disc...
research
10/11/2022

Strong negation in the theory of computable functionals TCF

We incorporate strong negation in the theory of computable functionals T...

Please sign up or login with your details

Forgot password? Click here to reset