Types for proofs and programs : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004 : revised selected papers
著者
書誌事項
Types for proofs and programs : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004 : revised selected papers
（Lecture notes in computer science, 3839）
Springer, c2006
大学図書館所蔵 件 / 全7件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
The 17 revised full papers presented here cover all current issues of formal reasoning and computer programming based on type theory are addressed; in particular languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education.
目次
Formalized Metatheory with Terms Represented by an Indexed Family of Types.- A Content Based Mathematical Search Engine: Whelp.- A Machine-Checked Formalization of the Random Oracle Model.- Extracting a Normalization Algorithm in Isabelle/HOL.- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis.- Formalising Bitonic Sort in Type Theory.- A Semi-reflexive Tactic for (Sub-)Equational Reasoning.- A Uniform and Certified Approach for Two Static Analyses.- Solving Two Problems in General Topology Via Types.- A Tool for Automated Theorem Proving in Agda.- Surreal Numbers in Coq.- A Few Constructions on Constructors.- Tactic-Based Optimized Compilation of Functional Programs.- Interfaces as Games, Programs as Strategies.- ?Z: Zermelo's Set Theory as a PTS with 4 Sorts.- Exploring the Regular Tree Types.- On Constructive Existence.
「Nielsen BookData」 より