…https://www.dropbox.com/s/2umr9ouz0jdelio/1407.pdf?dl=1 * 认知概率模型（Probabilistic Models of Cognition）: https://probmods.org 把逻辑、类型和证明融合在一起的材料，可能还没人写出来。一些不错的入门/先修资料：* 《Program = Proof》: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching... * 《Concrete Semantics》: http://concrete-semantics.org * 《The Hitchhiker’s Guide to Logical Verification》: https://raw.githubusercontent.com/blanchette/logical_verific...…
…https://www.dropbox.com/s/2umr9ouz0jdelio/1407.pdf?dl=1 * Probabilistic Models of Cognition: https://probmods.org Something that merges logic, types and proofs, perhaps yet to be written. Some good preliminary material: * Program = Proof: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching... * Concrete Semantics: http://concrete-semantics.org * The Hitchhiker’s Guide to Logical Verification: https://raw.githubusercontent.com/blanchette/logical_verific...…
……每一步想要实现什么，并且用地道的 F# 写出了功能等价的实现。那真的既好玩又有挑战性。第二部分还没碰，我最近正沉迷于塞缪尔·米姆兰（Samuel Mimram）的《Program = Proof》，简直爱不释手，这是我见过的第一本重点讲柯里-霍华德同构（Curry Howard Isomorphism）的书，涵盖了核心逻辑、lambda 演算、类型论和 Agda……太神了。
…accomplish in each step, and did something functionally equivalent in idiomatic F#. That was fun & challenging. haven't tackled the second part, I'm currently down the rabbit hole with Samuel Mimram's Program = Proof, which I'm just loving and the first book I've seen that focuses on the Curry Howard Isomorphism, covering essential logic, lambda calculus, type theory, and Agda... so good.
……多元微积分。分析学在附录中有讨论。所有证明都带有构造性偏向，所以对计算机背景的学生来说非常算法化且自然。习题解答在另一册。* 米姆兰（Mimram）写的《Program = Proof》。讨论了逻辑与计算，带你从基础一路走到依赖类型论（dependent type theory）及更深的内容。使用 OCaml 和 Agda。免费获取地址：https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
…multiple variable calculus. Analysis is discussed in an appendix. All proofs have a constructive bias, so it's very algorithmic and natural for a CS-minded student. Solutions are in a separate volume. * Program = Proof by Mimram. Discusses logic and computation, and takes you from the basics to depedent type theory and beyond. Uses OCaml and Agda. Freely available at: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
1. Program = Proof by Samuel Mimram Math foundation of programming. Church–Rosser theorem, Curry–Howard correspondence, intuitionistic logic, theorem proving with dependent types, etc. 2. Rust Atomics and Locks: Low-Level…
…not cover proof assistants. Alternatively you may enjoy these two. The latter is especially thorough, and begins with classical logic: * Concrete Semantics (Isabelle): http://concrete-semantics.org * Program = Proof (Agda): https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
…https://www.dropbox.com/s/2umr9ouz0jdelio/1407.pdf?dl=1 * 认知概率模型（Probabilistic Models of Cognition）: https://probmods.org 把逻辑、类型和证明融合在一起的材料，可能还没人写出来。一些不错的入门/先修资料：* 《Program = Proof》: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching... * 《Concrete Semantics》: http://concrete-semantics.org * 《The Hitchhiker’s Guide to Logical Verification》: https://raw.githubusercontent.com/blanchette/logical_verific...…
…https://www.dropbox.com/s/2umr9ouz0jdelio/1407.pdf?dl=1 * Probabilistic Models of Cognition: https://probmods.org Something that merges logic, types and proofs, perhaps yet to be written. Some good preliminary material: * Program = Proof: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching... * Concrete Semantics: http://concrete-semantics.org * The Hitchhiker’s Guide to Logical Verification: https://raw.githubusercontent.com/blanchette/logical_verific...…
……每一步想要实现什么，并且用地道的 F# 写出了功能等价的实现。那真的既好玩又有挑战性。第二部分还没碰，我最近正沉迷于塞缪尔·米姆兰（Samuel Mimram）的《Program = Proof》，简直爱不释手，这是我见过的第一本重点讲柯里-霍华德同构（Curry Howard Isomorphism）的书，涵盖了核心逻辑、lambda 演算、类型论和 Agda……太神了。
…accomplish in each step, and did something functionally equivalent in idiomatic F#. That was fun & challenging. haven't tackled the second part, I'm currently down the rabbit hole with Samuel Mimram's Program = Proof, which I'm just loving and the first book I've seen that focuses on the Curry Howard Isomorphism, covering essential logic, lambda calculus, type theory, and Agda... so good.
……多元微积分。分析学在附录中有讨论。所有证明都带有构造性偏向，所以对计算机背景的学生来说非常算法化且自然。习题解答在另一册。* 米姆兰（Mimram）写的《Program = Proof》。讨论了逻辑与计算，带你从基础一路走到依赖类型论（dependent type theory）及更深的内容。使用 OCaml 和 Agda。免费获取地址：https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
…multiple variable calculus. Analysis is discussed in an appendix. All proofs have a constructive bias, so it's very algorithmic and natural for a CS-minded student. Solutions are in a separate volume. * Program = Proof by Mimram. Discusses logic and computation, and takes you from the basics to depedent type theory and beyond. Uses OCaml and Agda. Freely available at: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
《Program = Proof》，塞缪尔·米姆兰（Samuel Mimram）著：https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching.... 亚马逊上也有纸质书出售。
Program = Proof, Samuel Mimram: https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching.... Also available as hardcopy in Amazon.
1. 《Program = Proof》，塞缪尔·米姆兰（Samuel Mimram）著。编程的数学基础。邱奇-罗瑟定理（Church–Rosser theorem）、柯里-霍华德对应（Curry–Howard correspondence）、直觉主义逻辑、基于依赖类型的定理证明等。2. 《Rust Atomics and Locks: Low-Level…
1. Program = Proof by Samuel Mimram Math foundation of programming. Church–Rosser theorem, Curry–Howard correspondence, intuitionistic logic, theorem proving with dependent types, etc. 2. Rust Atomics and Locks: Low-Level…
……不涉及证明助手（proof assistants）。或者你可以看看这两本。后一本尤其详尽，而且是从经典逻辑开始讲起：* 《Concrete Semantics》（使用 Isabelle）：http://concrete-semantics.org * 《Program = Proof》（使用 Agda）：https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...
…not cover proof assistants. Alternatively you may enjoy these two. The latter is especially thorough, and begins with classical logic: * Concrete Semantics (Isabelle): http://concrete-semantics.org * Program = Proof (Agda): https://www.lix.polytechnique.fr/Labo/Samuel.Mimram/teaching...