Mathematical bases of semantic programming
Saved in:
| Title: | Mathematical bases of semantic programming |
|---|---|
| Authors: | Goncharov, S. S., Sviridenko, D. I. |
| Publisher Information: | Consultants Bureau, New York |
| Subject Terms: | \(\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 |
| Description: | 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. |
| Document Type: | Article |
| File Description: | application/xml |
| Access URL: | https://zbmath.org/4049008 |
| Accession Number: | edsair.c2b0b933574d..b4a7ddaa1e24e8bc8c1d903abb1bda80 |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!