carian buku
buku
Menyokong
Log masuk ke
Log masuk ke
pengguna yang dibenarkan mempunyai akses kepada:
cadangan peribadi
Bot Telegram
sejarah muat turun
menghantar ke E-mel atau Kindle
pengurusan senarai buku
penyimpanan ke favorit
Peribadi
Permintaan buku
Penelitian
Z-Recommend
Senarai buku
Yang paling popular
Kategori
Penyertaan
Menyokong
Muat naik
Litera Library
Menyumbangkan buku kertas
Menambahkan buku-buku kertas
Search paper books
LITERA Point saya
Carian kata kunci
Main
Carian kata kunci
search
1
交互式定理证明与程序开发:Coq归纳构造演算的艺术
清华大学出版社
顾明
,
Yves Bertot
,
Pierre Casteran
函
归
纳
略
coq
递
练
intros
赖
描
含
match
theorem
范
辑
逻
apply
符
匹
qed
check
false
介
绍
虑
a:set
lcons
n:nat
elim
操
bool
库
域
inductive
scope
rewrite
射
llist
simpl
fixpoint
lemma
互
签
assumption
杂
析
索
键
叉
典
Tahun:
2010
Bahasa:
chinese
Fail:
PDF, 15.12 MB
Tag anda:
0
/
0
chinese, 2010
2
Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Constructions
Springer
Yves Bertot
,
Pierre Castéran
function
inductive
coq
theorem
functions
goal
induction
argument
intros
recursive
arguments
proofs
match
tactics
sect
prove
construct
defined
predicate
apply
dependent
define
check
module
qed
false
principle
matching
infinite
constructor
context
consider
programming
equality
command
variables
values
statement
a:set
definitions
elim
programs
n:nat
scope
rewrite
theorems
binary
calculus
lemma
bool
Tahun:
2004
Bahasa:
english
Fail:
PDF, 10.13 MB
Tag anda:
5.0
/
5.0
english, 2004
3
Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions
Springer
Yves Bertot
,
Pierre Castéran
function
inductive
coq
theorem
functions
goal
argument
induction
intros
recursive
arguments
proofs
match
tactics
sect
prove
construct
defined
apply
predicate
dependent
define
check
module
qed
false
principle
infinite
matching
context
constructor
equality
consider
programming
scope
variables
values
command
lcons
a:set
lemma
statement
elim
rewrite
programs
definitions
calculus
binary
bool
theorems
Tahun:
2004
Bahasa:
english
Fail:
DJVU, 3.17 MB
Tag anda:
0
/
0
english, 2004
4
Concrete Abstractions: Formalizing and Analyzing Discrete Theories and Algorithms with the RISCAL Model Checker
Springer
Wolfgang Schreiner
invariant
theorem
algorithm
execution
client
riscal
formula
resource
array
bool
ensures
verification
false
variables
values
decreases
function
output
polynomial
error
invariants
executing
checked
inputs
step
propositional
satisfies
checking
corresponding
a:set
n:num
proc
search
nodes
clause
models
formulas
map
zero
discs
correctness
rnum
m:num
network
node
shared
specification
theorems
computation
clauses
Tahun:
2023
Bahasa:
english
Fail:
PDF, 4.14 MB
Tag anda:
0
/
5.0
english, 2023
5
Twenty-five years of constructive type theory. Proceedings of a congress held in Venice, october 1995
Oxford University Press, USA
Giovanni Sambin
,
Jan M. Smith
defined
formal
induction
martin
function
theorem
mathematics
lemma
define
classical
proofs
formula
sets
intuitionistic
interpretation
subset
introduction
record
finite
elimination
equality
notation
redi
mathematical
calculus
element
prove
variables
analysis
storage
constructive
subsets
systems
ordinal
proposition
groupoid
assume
equal
operators
checking
functions
predicate
universes
formulas
introduce
consider
axiom
programming
definitions
dependent
Tahun:
1998
Bahasa:
english
Fail:
DJVU, 2.07 MB
Tag anda:
0
/
0
english, 1998
1
Ikuti
pautan ini
atau cari bot "@BotFather" dalam Telegram
2
Hantar arahan /newbot
3
Berikan nama untuk bot anda
4
Berikan nama pengguna untuk bot
5
Salin mesej terbaharu daripada BotFather dan tampalkannya di sini
×
×