---

＜電子ブック＞
Types for Proofs and Programs : International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers / edited by Henk Barendregt, Tobias Nipkow
(Lecture Notes in Computer Science. ISSN:16113349 ; 806)

版	1st ed. 1994.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1994
本文言語	英語
大きさ	IX, 395 p : online resource
著者標目	Barendregt, Henk editor Nipkow, Tobias editor SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Software engineering LCSH:Machine theory LCSH:Artificial intelligence FREE:Theory of Computation FREE:Software Engineering FREE:Formal Languages and Automata Theory FREE:Computer Science Logic and Foundations of Programming FREE:Artificial Intelligence
一般注記	Proving strong normalization of CC by modifying realizability semantics -- Checking algorithms for Pure Type Systems -- Infinite objects in type theory -- Conservativity between logics and typed ? calculi -- Logic of refinement types -- Proof-checking a data link protocol -- Elimination of extensionality in Martin-Löf type theory -- Programming with streams in Coq a case study: The Sieve of Eratosthenes -- The Alf proof editor and its proof engine -- Encoding Z-style Schemas in type theory -- The expressive power of Structural Operational Semantics with explicit assumptions -- Developing certified programs in the system Coq the program tactic -- Closure under alpha-conversion -- Machine Deduction -- Type theory and the informal language of mathematics -- Semantics for abstract clauses This volume contains thoroughly refereed and revised full papers selected from the presentations at the first workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Nijmegen, The Netherlands, in May 1993. As the whole ESPRIT BRA 6453, this volume is devoted to the theoretical foundations, design and applications of systems for theory development. Such systems help in designing mathematical axiomatisation, performing computer-aided logical reasoning, and managing databases of mathematical facts; they are also known as proof assistants or proof checkers HTTP:URL=https://doi.org/10.1007/3-540-58085-9

 類似資料