A COLLECTION OF

HARDLY ACCESSIBLE PUBLICATIONS

IN THEORETICAL COMPUTER SCIENCE

WITH A HISTORICAL INTEREST

On type theory, lambda calculus and explicit substitutions

On termination of term rewrite systems

On confluence

Presentation of a refutation complete method in presence of rewrite rules based on paramodulation.

On syntax

Thanks to Peter Aczel, Frédéric Blanqui, Nachum Dershowitz, Mariangiola Dezani, Roger Hindley, Gérard Huet, Luca Paolini, Claude Pair, David Plaisted, and Damien Pous for their contribution to this page and to Jean-Jacques Levy for his support.


Pierre Lescanne
Last modified: Wed Oct 1 11:13:36 CEST 2008