Abstract
AbstractTask-oriented programming (top) is a new programming paradigm for specifying multi-user workflows. To reason formally abouttopprograms, a formal language calledTopHathas been designed, together with its operational semantics. For proving properties about task-oriented programs, it is desirable to know when twoTopHat-programs are semantically equivalent. This paper aims to answer this question. We show that a task can be in either one of five conditions, and for every two tasks in the same condition, we define what it means for them to be semantically equivalent. Using this definition, we study a number of transformation laws forTopHat-programs, which can be used by developers and compilers to optimisetop-programs. We show that the "Image missing"operation on types inTopHatis a functor but cannot be a monad. We support our findings with proofs formalised in the dependently typed programming languageIdris.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
