Paramiko 是一个用于python2.5或更高版本的实现了使用SSH2协议安全(加密与验证)的连接远程计算机的模块
The .v code is a gorgeous example of literal programming and the compiled .html website is full-fledged. So this note is intended to be NOT self-contained and only focus on things I found essential or interesting. This note is intended to be very personal and potentially mix English with Chinese (You can Lol) So yeah. Don’t expect it to be well organized and well written. I posted it on blog mainly for my own references purpose. The quotes could either come from the book or saying from someone (even including me).
Some module (e.g.Map) not found either maunally make map.vo or proof general can solve that.
设定和构思 由于这是与SF合作的第一个项目,我们设计了短动画,并将它们制作成线上表情包。为了确保三个角色看起来是和谐的,我们专注通过角色之间的互动来传递信息,而不是简单地介绍角色。 Since this was the first collaboration project with SF, we organized short episodes and made them into our penguins will meet with artists from all over the world. 03 壁纸 | Wallpaper ◀向左滑动查看更多图片 后台回复【SF working on their own contents with their own story. https://www.super-fiction.com/ 当然表情联合设计仅是第一步,极致 QQ x SF
Inductive ty : Type := (* record types *) | RNil : ty | RCons : string → ty → ty → ty. we need
A weird convention through out all IMP is:
having both width/permulation subtyping make impl slow
Until today, We were living in the monomorphic world of Coq. So if we want a list, we have to define it for each type:
So the book material is designed to be gradually reveal the facts that
Step-Indexed Evaluator …Copied from 12-imp.md: Chapter ImpCEvalFun provide some workarounds to make functional evalution works: step-indexed evaluator, i.e. limit the recursion depth. (think about Depth-Limited Search). return option to tell if it’s a norm
The equality operator = is also a function that returns a Prop. (property: equality)
basically, parser combinator (But 非常麻烦 in Coq)
-b 删除,覆盖以前建立的链接 -d 允许超级用户制作目录的硬链接 -f 强制执行 -i 交互模式,文件存在则提示用户是否覆盖 -n 把符号链接视为一般目录 -s 软链接(符号链接) -v 显示详细的处理过程
Click the play button and then you can find this account in the SF.
Pair of Numbers Q: Why name inductive? A: Inductive means building things bottom-up, it doesn’t have
对于我们只有 bool 一个 base type 的 STLC,只需要 bool 和 λ:
P only need to fullfill l : the_type but not n:nat since we are proving property of the_type.
I have been long confused with Unary Relations vs. Binary Relation on the Same Set (homogeneous relation) I thought they were same…but turns out they are totally different!
Ltac - automated forward reasoning (hypothesis matching machinery)
It also works with conditional hypotheses: