Abstract: We describe a new logic programming language Delta that is based on the theory of semantic programming and dynamic logic. All Delta--programs are p--computable, verifiable, and can be translated into other high level languages. We also describe a Delta--methodology for constructing new data types and p--computable programs in high level languages such as PHP, Java, JavaScript, C++, Pascal, Delphi, Python, Solidity, and others. We would like to pay a special attention to the use of the Delta--methodology for creating Smart Contacts. We define dynamic models and consider Delta--programs as list--formulas built from other formulas on dynamic models. Theorem: Any Delta--program is p--computable.

Cite: Nechesov A.V.
Delta: a new logic programming language & Delta--methodology for p--computable programs in Turing Complete Languages
In compilation Международная конференция «Мальцевские чтения», 19-23 августа 2019 г. Тезисы докладов.. – ИМ СО РАН, НГУ., 2019. – C.95-96.

Identifiers: No identifiers

Citing: Пока нет цитирований