Volume 272,
Number 1-2,
February 2002
Theories of Types and Proofs 1997,
Tokyo,
Japan,
8-18 September 1997
- Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi:
Theories of Types and Proofs 1997 - Preface.
1-2
Electronic Edition (link) BibTeX
- Steffen van Bakel, Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan de Vries:
Intersection types for lambda-trees.
3-40
Electronic Edition (link) BibTeX
- Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type systems.
41-68
Electronic Edition (link) BibTeX
- Mario Coppo, Ferruccio Damiani, Paola Giannini:
Strictness, totality, and non-standard-type inference.
69-112
Electronic Edition (link) BibTeX
- Ryu Hasegawa:
Two applications of analytic functors.
113-175
Electronic Edition (link) BibTeX
- Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii:
Towards the animation of proofs - testing proofs by examples.
177-195
Electronic Edition (link) BibTeX
- Hajime Ishihara, Toshihiko Kurata:
Completeness of intersection and union type assignment systems for call-by-value lambda-models.
197-221
Electronic Edition (link) BibTeX
- Yukiyoshi Kameyama, Masahiko Sato:
Strong normalizability of the non-deterministic catch/throw calculi.
223-245
Electronic Edition (link) BibTeX
- Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong:
Innocent game models of untyped lambda-calculus.
247-292
Electronic Edition (link) BibTeX
- Martijn Oostdijk, Herman Geuvers:
Proof by computation in the Coq system.
293-314
Electronic Edition (link) BibTeX
- Tarmo Uustalu, Varmo Vene:
Least and greatest fixed points in intuitionistic natural deduction.
315-339
Electronic Edition (link) BibTeX
- Hirofumi Yokouchi:
Completeness of type assignment systems with intersection, union, and type quantifiers.
341-398
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:24:42 2009
by Michael Ley (ley@uni-trier.de)
