We explore some foundational issues in the development of a theory of intensional semantics. A programming language may be given a variety of semantics, differing in the level of abstraction; one generally chooses the semantics at an abstraction level appropriate for reasoning about a particular kind of program property. Extensional semantics are typically appropriate for proving properties such as partial correctness, but an intensional semantics at a lower abstraction level is required in order to reason about computation strategy and thereby support reasoning about intensional aspects of behavior such as order of evaluation and efficiency. It is obviously desirable to be able to establish sensible relationships between two semantics for the same language, and we seek a general category-theoretic framework that permits this. Beginning with an "extensional" category, whose morphisms we can think of as functions of some kind, we model a notion of computation as a comonad with certain e...

Abstract. The purpose of this paper is to introduce a cohomology theory for abelian matched pairs of Hopf algebras and to explore its relationship to Sweedler cohomology, to Singer cohomology and to extension theory. An exact sequence connecting these cohomology theories is obtained for a general abelian matched pair of Hopf algebras, generalizing those of Kac and Masuoka for matched pairs of finite groups and finite dimensional Lie algebras. The morphisms in the low degree part of this sequence are given explicitly, enabling concrete computations. In this paper we discuss various cohomology theories for Hopf algebras and their relation to extension theory. It is natural to think of building new algebraic objects from simpler structures, or to get information about the structure of complicated objects by