书籍详情
证明与程序的类型
作者:Paul Callaghan 等著
出版社:湖南文艺出版社
出版时间:2000-12-01
ISBN:9783540432876
定价:¥452.00
购买这本书可以去
内容简介
This book constitutes the thoroughly refereed post-proceedings of the International Workshop of the TYPES Working Group, TYPES 2000, held in Durham, UK in December 2000.The 15 revised full papers presented were carefully reviewed and selected during two rounds of refereeing and revision. All current issues on type theory and type systems and their applications to programming, systems design, and proof theory are addressed.
作者简介
暂缺《证明与程序的类型》作者简介
目录
Collection Principles in Dependent Type Theory
Executing Higher Order Logic
A Tour with Constructive Real Numbers
An Implementation of Type:Type
On the Logical Content of Computational Type Theory:A Solution to Curry’S Problem
Constructive Reals in Coq:Axioms and Categoricity
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
A Kripke-style Model for the Admissibility of Structural Rules
Towards Limit Computable Mathematics
Formalizing the Halting Problem in a Constructive Type Theory
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
Changing Data Structures in Type Theory:A Study of Natural Numbers
Elimination with a Motive
Generalization in Type Theory Based Proof Assistants
An Inductive Version of Nash-Williams'Minimal-Bad-Sequence Argument for Higman's Lemma
Author Index
Executing Higher Order Logic
A Tour with Constructive Real Numbers
An Implementation of Type:Type
On the Logical Content of Computational Type Theory:A Solution to Curry’S Problem
Constructive Reals in Coq:Axioms and Categoricity
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
A Kripke-style Model for the Admissibility of Structural Rules
Towards Limit Computable Mathematics
Formalizing the Halting Problem in a Constructive Type Theory
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
Changing Data Structures in Type Theory:A Study of Natural Numbers
Elimination with a Motive
Generalization in Type Theory Based Proof Assistants
An Inductive Version of Nash-Williams'Minimal-Bad-Sequence Argument for Higman's Lemma
Author Index
猜您喜欢