( 证明与程序的类型)Types for Proofs and Programs
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,计算机理论,
作者： Paul Callaghan等著
出 版 社： 湖南文艺出版社
出版时间： 2000-12-1字数：版次： 1页数： 242印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540432876包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS including its subseries LNAI spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）
内容简介
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
