defuse 发表于 2025-4-1 05:02:00

http://reply.papertrans.cn/23/2234/223357/223357_61.png

Stable-Angina 发表于 2025-4-1 09:04:56

http://reply.papertrans.cn/23/2234/223357/223357_62.png

Reservation 发表于 2025-4-1 11:49:19

Certified Parsing of Regular Languagess a regular expression if and only if the NFA accepts it. The proof of the if-part is effectively a function turning acceptance of a string into a parse tree while the only-if part gives a function turning rejection into a proof of impossibility of a parse tree.

BOLUS 发表于 2025-4-1 17:22:09

A Formal Proof of Borodin-Trakhtenbrot’s Gap Theoremons required to prove the result (smaller than expected, actually). The work is part of a long term . program, whose goal is to obtain, via a reverse methodological approach, a formal treatment of Complexity Theory at a comfortable level of abstraction and logical rigor.

Cocker 发表于 2025-4-1 20:26:50

http://reply.papertrans.cn/23/2234/223357/223357_65.png

hyperuricemia 发表于 2025-4-2 01:57:49

http://reply.papertrans.cn/23/2234/223357/223357_66.png

抛物线 发表于 2025-4-2 04:35:09

Episode I: The 1986 Legislation, polynomials and .-terms modulo .-equivalence. The many-sorted metatheory of nonfree datatypes is formalized as an ordinary Isabelle theory and is animated by the package into user-specified instances. HOL lacks a type of types, so we employ an ad hoc construction of a universe embedding the relevant parameter types.

放肆的你 发表于 2025-4-2 10:32:08

http://reply.papertrans.cn/23/2234/223357/223357_68.png
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Certified Programs and Proofs; Third International Georges Gonthier,Michael Norrish Conference proceedings 2013 Springer International Pub