Composition aspects of programmology. I

DOI10.1007/BF01074922zbMath0646.68015OpenAlexW4239865904MaRDI QIDQ3790610

V. N. Red'ko, N. S. Nikitchenko

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074922

zbMATH Keywords

semanticsprogram compositioncomposition programming

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (3)

Estimating the execution complexity of logical specifications based on context-free grammars ⋮ Completeness problems in classes of computable named functions ⋮ Initial semantics of logic specifications with negation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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?

This page was built for publication: Composition aspects of programmology. I