Types for proofs and programs
by Bernhard Reus
No club is reading this yet — be the first to start one
Author: Thorsten Altenkirch, Bernhard Reus, Wolfgang Naraschewski
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66537-3
DOI: 10.1007/3-540-48167-2
Table of Contents:
- On Relating Type Theories and Set Theories
- Communication Modelling and Context-Dependent Interpretation: An Integrated Approach
- Gröbner Bases in Type Theory
- A Modal Lambda Calculus with Iteration and Case Constructs
- Proof Normalization Modulo
- Proof of Imperative Programs in Type Theory
- An Interpretation of the Fan Theorem in Type Theory
- Conjunctive Types and SKInT
- Modular Structures as Dependent Types in Isabelle
- Metatheory of Verification Calculi in LEGO
- Bounded Polymorphism for Extensible Objects
- About Effective Quotients in Constructive Type Theory
- Algorithms for Equality and Unification in the Presence of Notational Definitions
- A Preview of the Basic Picture: A New Perspective on Formal Topology
Discuss Types for proofs and programs with other readers
Join or start a book club for Types for proofs and programs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Types for proofs and programs?
Sign up free on Readfeed, then browse public clubs or start your own club with Types for proofs and programs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Types for proofs and programs with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Types for proofs and programs with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.