This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

Intuitionistic linear logic regains the expressive power of intuitionistic logic through the!('of
course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment …

This chapter provides an introduction to the interaction between category theory and
mathematical logic. Category theory describes properties of mathematical structures via their …

We present a categorical logic formulation of induction and coinduction principles for
reasoning about inductively and coinductively defined types. Our main results provide …

New tools are presented for reasoning about properties of recursively defined domains. We
work within a general, category-theoretic framework for various notions of “relation” on …

Models of intuitionistic linear logic also provide models of Moggi's computational
metalanguage. We use the adjoint presentation of these models and the associated adjoint …

We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration
operator is defined embodying the equational properties of iteration theories. We prove a …

Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for
implementing recursive computation efficiently. To capture its semantic nature, we introduce …

A common attraction to functional programming is the ease with which proofs can be given
of program properties. A common disappointment with functional programming is the …

Notes on sconing and relators Page 1 Notes on Sconing and Relators John C. Mitchell* and
Andre Scedrov** Department of Computer Science Stanford University Stanford, CA 94305 2 …