AbstractAlong the lines of classical categorical type theory for total functions, we establish correspondence results between certain classes of partial equational theories on the one hand and suitable classes of categories having certain finite limits on the other hand. E.g., we show that finitary partial theories with existentially conditioned equations are essentially the same as cartesian categories with distinguished domains, and that partial λ-calculi with internal equality are equivalent to a suitable class of partial cartesian closed categories
AbstractThis paper attempts to reconcile the various abstract notions of “category of partial maps” ...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
International audienceWe prove a categorical duality between a class of abstract algebras of partial...
AbstractAlong the lines of classical categorical type theory for total functions, we establish corre...
AbstractA logic is developed in which function symbols are allowed to represent partial functions. I...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractIn this paper we consider two conceptually different categorical approaches to partiality na...
AbstractThis paper explores the fine structure of classifying categories of partial equational theor...
Grant ARG 2281/14/6This thesis is an investigation into axiomatic categorical domain theory as neede...
AbstractA new algebraic approach to abstract computing systems based on lambda calculi and cartesian...
It is well-known how to model simply typed -calculus using cartesian closed categories (Lambek and S...
AbstractA category K (of data types) is called algebraically ω-complete provided that for each endof...
Introduction Partial maps are naturally ordered according to their extent of definition. Constructi...
We investigate the representation and complete representation classes for algebras of partial functi...
AbstractThis paper attempts to reconcile the various abstract notions of “category of partial maps” ...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
International audienceWe prove a categorical duality between a class of abstract algebras of partial...
AbstractAlong the lines of classical categorical type theory for total functions, we establish corre...
AbstractA logic is developed in which function symbols are allowed to represent partial functions. I...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractIn this paper we consider two conceptually different categorical approaches to partiality na...
AbstractThis paper explores the fine structure of classifying categories of partial equational theor...
Grant ARG 2281/14/6This thesis is an investigation into axiomatic categorical domain theory as neede...
AbstractA new algebraic approach to abstract computing systems based on lambda calculi and cartesian...
It is well-known how to model simply typed -calculus using cartesian closed categories (Lambek and S...
AbstractA category K (of data types) is called algebraically ω-complete provided that for each endof...
Introduction Partial maps are naturally ordered according to their extent of definition. Constructi...
We investigate the representation and complete representation classes for algebras of partial functi...
AbstractThis paper attempts to reconcile the various abstract notions of “category of partial maps” ...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
International audienceWe prove a categorical duality between a class of abstract algebras of partial...