Types for Proofs and Programs: International Workshop, TYPES’ 98 Kloster Irsee, Germany, March 27–31, 1998 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Types for Proofs and Programs, TYPES '98, held under the auspices of the ESPRIT Working Group 21900.
The 14 revised full papers presented went through a thorough process of reviewing and revision and were selected from a total of 25 candidate papers. All current aspects of type theory and type systems and their relation to proof theory are addressed.

Author(s): Peter Aczel (auth.), Thorsten Altenkirch, Bernhard Reus, Wolfgang Naraschewski (eds.)
Series: Lecture Notes in Computer Science 1657
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999

Language: English
Pages: 212
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics)

On Relating Type Theories and Set Theories....Pages 1-18
Communication Modelling and Context-Dependent Interpretation: An Integrated Approach....Pages 19-32
Gröbner Bases in Type Theory....Pages 33-46
A Modal Lambda Calculus with Iteration and Case Constructs....Pages 47-62
Proof Normalization Modulo....Pages 62-77
Proof of Imperative Programs in Type Theory....Pages 78-92
An Interpretation of the Fan Theorem in Type Theory....Pages 93-105
Conjunctive Types and SKInT....Pages 106-120
Modular Structures as Dependent Types in Isabelle....Pages 121-133
Metatheory of Verification Calculi in LEGO....Pages 133-149
Bounded Polymorphism for Extensible Objects....Pages 149-165
About Effective Quotients in Constructive Type Theory....Pages 166-178
Algorithms for Equality and Unification in the Presence of Notational Definitions....Pages 179-193
A Preview of the Basic Picture: A New Perspective on Formal Topology....Pages 194-208