In EDS ansehen

Semantic programming

Gespeichert in:

Bibliographische Detailangaben
Titel:	Semantic programming
Autoren:	Ershov, Yu. L., Goncharov, S. S., Sviridenko, D. I.
Schlagwörter:	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
Beschreibung:	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.
Publikationsart:	Article
Dateibeschreibung:	application/xml
Zugangs-URL:	https://zbmath.org/4037166
Dokumentencode:	edsair.c2b0b933574d..547722cff06cc3847ea0de2a0b33d973
Datenbank:	OpenAIRE

Beschreibung
Abstract:	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.