唤醒 发表于 2025-3-25 05:33:47
http://reply.papertrans.cn/83/8262/826122/826122_21.pngFECT 发表于 2025-3-25 09:36:14
http://reply.papertrans.cn/83/8262/826122/826122_22.pngLATER 发表于 2025-3-25 13:37:19
A Mechanised Abstract Formalisation of Concept Lattices], . We do this in the abstract setting of locally ordered categories with converse (OCCs) with residuals and direct powers, without requiring meets (as in allegories) or joins (as in Kleene categories). The abstract formalisation has the advantage that it can be used both for theoretical reaQUAIL 发表于 2025-3-25 18:39:48
A Sufficient Condition for Liftable Adjunctions between Eilenberg-Moore Categoriesry of .′-algebras over .-algebras. The leading example is an adjunction between the category of idempotent semirings and the category of quantales, where . is the finite powerset monad, .′ is the powerset monad, and . is the free monoid monad. The left adjoint of this leading example is given by idepodiatrist 发表于 2025-3-25 23:50:45
http://reply.papertrans.cn/83/8262/826122/826122_25.png厌倦吗你 发表于 2025-3-26 01:54:11
http://reply.papertrans.cn/83/8262/826122/826122_26.png反馈 发表于 2025-3-26 04:29:35
http://reply.papertrans.cn/83/8262/826122/826122_27.png孤独无助 发表于 2025-3-26 09:03:36
Extended Conscriptions Algebraicallyximation order for conscriptions and one for extended conscriptions, which additionally represent aborting executions. We give a new computation model which generalises extended conscriptions and apply the algebraic techniques for a unified treatment.叫喊 发表于 2025-3-26 14:22:52
http://reply.papertrans.cn/83/8262/826122/826122_29.pngincredulity 发表于 2025-3-26 17:18:56
A Mechanised Abstract Formalisation of Concept Latticesmeets (as in allegories) or joins (as in Kleene categories). The abstract formalisation has the advantage that it can be used both for theoretical reasoning, and for executable implementations, by instantiating it with appropriate choices of concrete OCCs.