Preface Part I. Introduction to Category Theory: Part II. Cartesian Closed Categories and Calculus: Part III. Type Theory and Toposes: Part IV. Representing Numerical Functions in Various Categories… Expand

Usual typed lambda-calculi yield input/output specifications; in this paper the authors show how to extend this paradigm to complexity specifications.Expand

Abstract We detail Abramsky's “proofs-as-processes” paradigm for interpreting classical linear logic (CLL) into a “synchronous” version of the π-calculus recently proposed by Milner (1992, 1993).Expand

We show how to solve the word problem for simply typed λβη-calculus by using a few well-known facts about categories of presheaves and the Yoneda embedding.Expand

This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic… Expand

Solves the decision problem for simply typed lambda calculus with a strong binary sum, or, equivalently, the word problem for free Cartesian closed categories with binary co-products.Expand

What equations can we guarantee that simple functional programs must satisfy, irrespective of their obvious defining equations? Equivalently, what non-trivial identifications must hold between lambda… Expand