| 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.） |
| 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 |
内容加载中，请稍后...
商品评论（0条）