


default search action
Theoretical Computer Science, Volume 272
Volume 272, Number 1-2, February 2002
- Mariangiola Dezani-Ciancaglini

, Mitsuhiro Okada, Masako Takahashi:
Theories of Types and Proofs 1997 - Preface. 1-2 - Steffen van Bakel

, Franco Barbanera, Mariangiola Dezani-Ciancaglini
, Fer-Jan de Vries:
Intersection types for lambda-trees. 3-40 - Frédéric Blanqui

, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type systems. 41-68 - Mario Coppo, Ferruccio Damiani

, Paola Giannini
:
Strictness, totality, and non-standard-type inference. 69-112 - Ryu Hasegawa:

Two applications of analytic functors. 113-175 - Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii:

Towards the animation of proofs - testing proofs by examples. 177-195 - Hajime Ishihara, Toshihiko Kurata:

Completeness of intersection and union type assignment systems for call-by-value lambda-models. 197-221 - Yukiyoshi Kameyama, Masahiko Sato:

Strong normalizability of the non-deterministic catch/throw calculi. 223-245 - Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong

:
Innocent game models of untyped lambda-calculus. 247-292 - Martijn Oostdijk, Herman Geuvers:

Proof by computation in the Coq system. 293-314 - Tarmo Uustalu

, Varmo Vene
:
Least and greatest fixed points in intuitionistic natural deduction. 315-339 - Hirofumi Yokouchi:

Completeness of type assignment systems with intersection, union, and type quantifiers. 341-398

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














