在调用值中表示守卫性及守卫参数化单调子
Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
AI总结:
本文研究了调用值中守卫迭代的语义,通过参数化单调子推广了守卫性作为程序内在属性的描述。
摘要:
就像通过(强)单调子来分类各种不纯的风味,包括异常、非确定性、概率、局部和全局存储一样,守卫性在各种设置中分类了循环的良好行为。在最一般的形式下,守卫性纪律适用于一般的对称单调范畴,并进一步专门化为笛卡尔和共笛卡尔范畴,其中它分别管理守卫递归和守卫迭代。在这里,更加具体地说,我们处理调用值守卫迭代的语义。Levy、Power和Thielecke已经证明,调用值语言可以普遍地解释为Freyd范畴,但为了表示效果ful函数空间,这样的范畴必须从强单调子中自然产生。我们通过证明,表示守卫效果ful函数空间需要某种参数化单调子(在Uustalu的意义下)来推广这一事实。这提供了守卫性作为程序内在范畴属性的描述,补充了现有将守卫性作为范畴上谓词的描述。
英文摘要:
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the notion of guardedness classifies well-behavedness of cycles in various settings. In its most general form, the guardedness discipline applies to general symmetric monoidal categories and further specializes to Cartesian and co-Cartesian categories, where it governs guarded recursion and guarded iteration, respectively. Here, even more specifically, we deal with the semantics of call-by-value guarded iteration. It was shown by Levy, Power and Thielecke that call-by-value languages can be generally interpreted in Freyd categories, but in order to represent effectful function spaces, such a category must canonically arise from a strong monad. We generalize this fact by showing that representing guarded effectful function spaces calls for certain parameterized monads (in the sense of Uustalu). This provides a description of guardedness as an intrinsic categorical property of programs, complementing the existing description of guardedness as a predicate on a category.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。