Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with λ-terms. However, if one goes further and uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from values to values ) that may jeopardise the applicability of theoretical results. In this paper we introduce calculi, based on a categorical semantics for computations , that provide a correct basis for proving equivalence of programs for a wide range of notions of computation .

Notions of computation and monads

Received by the editors 2004-10-30. Transmitted by Steve Lack, Ross Street and RJ Wood. Reprint published on 2005-04-23. Several typographical errors corrected 2012-05-13. 2000 Mathematics Subject Classification: 18-02, 18D10, 18D20.

/pdf/basic-concepts-of-enriched-category-theory-f320y2evfi.pdf

Basic concepts of enriched category theory

Conditional rewriting logic as a unified model of concurrency

Although numerous contributions from divers authors, over the past fifteen years or so, have brought enriched category theory to a developed state, there is still no connected account of the theory, or even of a substantial part of it. As the applications of the theory continue to expand - some recent examples are given below - the lack of such an account is the more acutely felt. The present book is designed to supply the want in part, by giving a fairly complete treatment of the limited area to which the title refers. The basic concepts of category theory certainly include the notion of functor-category, of limit and colimit, of Kan extension, and of density; with their applications to completions, perhaps including those relative completions given by categories of algebras for limit-defined theories. If we read 'V-category' for 'category' here, this is essentially the list of our chapter-headings below, after the first chapter introducing V-categories.  In fact our scope is wider than this might suggest; for what we give is also a selfcontained account of basic category theory as described above, assuming as prior knowledge only the most elementary categorical concepts, and treating the ordinary and enriched cases together from Chapter 3 on.

/pdf/basic-concepts-of-enriched-category-theory-1mn867zj.pdf

G. M. Kelly

Papers

Basic concepts of enriched category theory

Basic concepts of enriched category theory

Review of the elements of 2-categories

Coherence for compact closed categories

Categories of continuous functors, I