Zobrazit v EDS

Semantic programming

Uloženo v:

Podrobná bibliografie
Název:	Semantic programming
Autoři:	Ershov, Yu. L., Goncharov, S. S., Sviridenko, D. I.
Témata:	Logic in computer science, Specification and verification (program logics, model checking, etc.), \(\Sigma \)-formulae, semantic programming, computable predicates of finite types, General topics in the theory of software, list extensions
Popis:	Summary: Described are methodological and mathematical aspects of a new concept of programming called ``semantic programming''. This concept is based on ideas and methods of mathematical logic and in particular, on the fact that computable functions and predicates admit formula description. In semantic programming, the so-called \(\Sigma\)-formulae are chosen as such descriptions, and their generalizations - \(\Sigma\)-expressions written in the language of the theory of list extensions of GES-models. Here the language of \(\Sigma\)-expressions allows us to construct \(\Sigma\)-programs containing computable predicates of finite types.
Druh dokumentu:	Article
Popis souboru:	application/xml
Přístupová URL adresa:	https://zbmath.org/4037166
Přístupové číslo:	edsair.c2b0b933574d..547722cff06cc3847ea0de2a0b33d973
Databáze:	OpenAIRE

Popis
Abstrakt:	Summary: Described are methodological and mathematical aspects of a new concept of programming called ``semantic programming''. This concept is based on ideas and methods of mathematical logic and in particular, on the fact that computable functions and predicates admit formula description. In semantic programming, the so-called \(\Sigma\)-formulae are chosen as such descriptions, and their generalizations - \(\Sigma\)-expressions written in the language of the theory of list extensions of GES-models. Here the language of \(\Sigma\)-expressions allows us to construct \(\Sigma\)-programs containing computable predicates of finite types.