Composition aspects of programmology. I
From MaRDI portal
Publication:3790610
DOI10.1007/BF01074922zbMath0646.68015MaRDI QIDQ3790610
V. N. Red'ko, N. S. Nikitchenko
Publication date: 1987
Published in: Cybernetics (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
68N01: General topics in the theory of software
Related Items
Estimating the execution complexity of logical specifications based on context-free grammars, Initial semantics of logic specifications with negation, Completeness problems in classes of computable named functions
Cites Work
- Computable compositions and universal program logics
- Necessary and sufficient conditions for the universality of programming formalisms
- Composition semantics of programming languages
- Program definers
- Compositions of programs that induce special monotonic functions
- Computable queries for relational data bases
- The Vienna development method: The meta-language
- Can programming be liberated from the von Neumann style?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item