نتایج جستجو برای: cartesian closed

تعداد نتایج: 130540  

Journal: :Ann. Pure Appl. Logic 2012
Alex K. Simpson Thomas Streicher

We define a constructive topos to be a locally cartesian closed pretopos. The terminology is supported by the fact that constructive toposes enjoy a relationship with constructive set theory similar to the relationship between elementary toposes and (impredicative) intuitionistic set theory. This paper elaborates upon one aspect of the relationship between constructive toposes and constructive ...

Journal: :CoRR 2010
Chris Preston

or171algebra12, 25adapted to typed set150associated37, 43, 150, 152bottomed58category-based126containing a typed set37disjoint from a typed set46extension of46free37functionally free145, 147functional145, 147ground term56heterogenous54initial12, 33initial completion of104<...

Journal: :Inf. Comput. 1987
Carl A. Gunter

We introduce a bicartesian closed category of what we call pro nite domains. Study of these domains is carried out through the use of an equivalent category of pre-orders in a manner similar to the information systems approach advocated by Dana Scott and others. A class of universal pro nite domains is de ned and used to derive su cient conditions for the pro nite solution of domain equations i...

2016
CECILIA FLORI Jonathan Elliott Peter Johnstone Peter LeFanu Lumsdaine Prakash Panangaden David Roberts Michael Shulman Rui Soares Barbosa

Sheaves are objects of a local nature: a global section is determined by how it looks locally. Hence, a sheaf cannot describe mathematical structures which contain global or nonlocal geometric information. To fill this gap, we introduce the theory of “gleaves”, which are presheaves equipped with an additional “gluing operation” of compatible pairs of local sections. This generalizes the conditi...

Journal: :Applied Categorical Structures 2000
Gerhard Preuß

Semiuniform convergence spaces form a common generalization of lter spaces (including symmetric convergence spaces and thus symmetric topological spaces] as well as Cauchy spaces) and uniform limit spaces (including uniform spaces) with many convenient properties such as cartesian closedness, hereditariness and the fact that products of quotients are quotients. Here, for each semiuniform conver...

Journal: :Mathematical Structures in Computer Science 2005
Dieter Spreen

A conjecture of Smyth is discussed which says that if D and [D → D] are effectively algebraic directed-complete partial orders with least element (cpo’s), then D is an effectively strongly algebraic cpo, where it was not made precise what is meant by an effectively algebraic and an effectively strongly algebraic cpo. Notions of an effectively strongly algebraic cpo and an effective SFP domain a...

Journal: :Mathematical Structures in Computer Science 2000
Steven Awodey

The λ-calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of λ-conversion is shown to be deductively complete with respect to such topological semantics. It is also shown to be functionally complete, in the sense that there is always a 'minimal' topological mod...

Journal: :Electr. Notes Theor. Comput. Sci. 2003
Luigi Santocanale

We prove that every finitary polynomial endofunctor of a category C has a final coalgebra if C is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of coalgebras for such an endofunctor has all finite limits.

2010
Maria Emilia Maietti Steven Vickers

Suppose in an arithmetic unverse we have two predicates φ and ψ for natural numbers, satisfying a base case φ(0) → ψ(0) and an induction step that, for generic n, the hypothesis φ(n) → ψ(n) allows one to deduce φ(n+ 1) → ψ(n+ 1). Then it is already true in that arithmetic universe that (∀n)(φ(n) → ψ(n)). This is substantially harder than in a topos, where cartesian closedness allows one to form...

2001
Dana S. Scott

Domain theory for denotational semantics is over thirty years old. There are many variations on the idea and many interesting constructs that have been proposed by many people for realizing a wide variety of types as domains. Generally, the effort has been to create categories of domains that are cartesian closed (that is, have products and function spaces interpreting typed calculus) and permi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید