SMART 发表于 2025-3-26 21:44:18
http://reply.papertrans.cn/71/7043/704205/704205_31.pngAccede 发表于 2025-3-27 01:15:41
http://reply.papertrans.cn/71/7043/704205/704205_32.pngjaunty 发表于 2025-3-27 08:17:37
http://reply.papertrans.cn/71/7043/704205/704205_33.png情节剧 发表于 2025-3-27 12:00:30
http://reply.papertrans.cn/71/7043/704205/704205_34.pngMaximizer 发表于 2025-3-27 17:15:18
http://reply.papertrans.cn/71/7043/704205/704205_35.pngcandle 发表于 2025-3-27 21:19:17
,Verifying a Semantic ,-Conversion Test for Martin-Löf Type Theory, abstract notion of semantic domain in order to accommodate a variety of possible implementation techniques, such as normal forms, weak head normal forms, closures, and compiled code. Our aim is to get closer than previous work to verifying the type-checking algorithms which are actually used in practice.