A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Sequential Relational Decomposition
2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natural formalization of sequential decomposition, in which a task is decomposed into two sequential sub-tasks, with the first sub-task to be executed out before the second sub-task is executed. These tasks are specified by means of input/output
doi:10.1145/3209108.3209203
dblp:conf/lics/FriedLOV18
fatcat:cyta6riskrhsxcuvbqp4fx5iuu