Home  Online Resources


Journal of Logic and Computation

Table of Contents

Volume 11, Issue 3: June 2001.

Fairouz Kamareddine.
pp. 359-361.
Details   Full-Text PDF (34 KB)

Reviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems

Fairouz Kamareddine.
pp. 363-394.
Abstract   Full-Text PDF (330 KB)

Approximation Theorems for Intersection Type Systems

Mariangiola Dezani-Ciancaglini,, Furio Honsell, and Yoko Motohama.
pp. 395-417.
Abstract   Full-Text PDF (282 KB)

About Folding-Unfolding Cuts and Cuts Modulo

Gilles Dowek.
pp. 419-429.
Abstract   Full-Text PDF (112 KB)

Explicit Substitutions and Reducibility

Hugo Herbelin.
pp. 431-451.
Abstract   Full-Text PDF (222 KB)

Algebraic Specifications, Higher-order Types and Set-theoretic Models

Hélène Kirchner, and Peter D. Mosses.
pp. 453-481.
Abstract   Full-Text PDF (294 KB)

Extensional Set Equality in the Calculus of Constructions

Jonathan P. Seldin.
pp. 483-493.
Abstract   Full-Text PDF (123 KB)

Books Received

p. 495.
Abstract   Full-Text PDF (8 KB)

Forthcoming Papers

pp. 497-498.
Full-Text PDF (30 KB)

Top of the Page

[ Oxford University Press]   [ Oxford Journals]   [ Comments & Feedback]   Copyright© Oxford University Press, 2001.