乏味
发表于 2025-4-1 04:05:01
,Intersection Types via Finite-Set Declarations,g of intersection types based on FSDs. Notably, our translation works without needing anything like the usual troublesome intersection-introduction rule that proves a pure untyped .-term . has an intersection type . using . independent subderivations. As such, our approach is useful for language imp
胎儿
发表于 2025-4-1 07:58:11
http://reply.papertrans.cn/59/5881/588056/588056_62.png
一再困扰
发表于 2025-4-1 13:57:02
,Polyadic Quantifiers on Dependent Types,y relations and quantification in these phenomena. Then we present, in a conceptual way, the mathematics behind the process of polyadic quantification over dependent types. The main new feature is the left strength on the cartesian monad over a basic fibration of a topos. It combines with what we ca