In EDS ansehen

Mathematical bases of semantic programming

Gespeichert in:

Bibliographische Detailangaben
Titel:	Mathematical bases of semantic programming
Autoren:	Goncharov, S. S., Sviridenko, D. I.
Verlagsinformationen:	Consultants Bureau, New York
Schlagwörter:	\(\Sigma \)-programming, canonical expansion, Data structures, universal machine, semantic programming, determinability, fixed points, functional programming, programming methodology, logical programming, Abstract data types, algebraic specification, abstract data types
Beschreibung:	An attempt in the development of a theory of computation that combines ideas of logical and functional programming with abstract data types is made [see also the authors, Math. Res. 31, 169-179 (1986; Zbl 0621.68021)]. Theorems (on determinability, on fixed points, on canonical expansion, and on the existence of a universal machine) supporting the feasibility of examining a class of logical formulas as a programming language are stated.
Publikationsart:	Article
Dateibeschreibung:	application/xml
Zugangs-URL:	https://zbmath.org/4049008
Dokumentencode:	edsair.c2b0b933574d..b4a7ddaa1e24e8bc8c1d903abb1bda80
Datenbank:	OpenAIRE

Beschreibung
Abstract:	An attempt in the development of a theory of computation that combines ideas of logical and functional programming with abstract data types is made [see also the authors, Math. Res. 31, 169-179 (1986; Zbl 0621.68021)]. Theorems (on determinability, on fixed points, on canonical expansion, and on the existence of a universal machine) supporting the feasibility of examining a class of logical formulas as a programming language are stated.