Completeness problems in classes of computable named functions

DOI10.1007/BF01070586zbMath0691.68015MaRDI QIDQ3033303

B. V. Gubskij, V. N. Red'ko, D. B. Buy

Publication date: 1988

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

program synthesisprogram algebrassemantic models of programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Computable compositions and universal program logics
• Composition semantics of programming languages
• Computable stack functions for semantics of stack programs
• Computable queries for relational data bases
• Composition aspects of programmology. I

This page was built for publication: Completeness problems in classes of computable named functions