The following pages link to A small complete category (Q1112159):
Displaying 50 items.
- Logical systems. I: Internal calculi. (Q326587) (← links)
- The category of equilogical spaces and the effective topos as homotopical quotients (Q504545) (← links)
- Aspects of predicative algebraic set theory. II: Realizability (Q534701) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- A note on ``Extensional PERs'' (Q615886) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- Functorial polymorphism (Q753948) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Categorical models of polymorphism (Q1193592) (← links)
- The extended calculus of constructions (ECC) with inductive types (Q1193601) (← links)
- Comprehension categories and the semantics of type dependency (Q1208414) (← links)
- From constructivism to computer science (Q1274450) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Axiomatizing higher-order Kleene realizability (Q1338200) (← links)
- Parametricity as isomorphism (Q1349670) (← links)
- Constructive sets in computable sets (Q1372877) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- On completeness and cocompleteness in and around small categories (Q1896485) (← links)
- Some free constructions in realizability and proof theory (Q1903677) (← links)
- Univalent polymorphism (Q1987219) (← links)
- Non-deterministic effects in a realizability model (Q2130600) (← links)
- A higher-order calculus and theory abstraction (Q2639838) (← links)
- Internal enriched categories (Q2674401) (← links)
- A Convenient Category of Domains (Q2864147) (← links)
- Categorifying Computations into Components via Arrows as Profunctors (Q2919448) (← links)
- A homotopy-theoretic model of function extensionality in the effective topos (Q3119466) (← links)
- Mathesis Universalis and Homotopy Type Theory (Q3305624) (← links)
- From parametric polymorphism to models of polymorphic FPC (Q3395309) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988 (Q3478381) (← links)
- (Q3483291) (← links)
- Bunched polymorphism (Q3545274) (← links)
- Categorical semantics for arrows (Q3638922) (← links)
- Semantics of the second order lambda calculus (Q4006235) (← links)
- Least fixpoints of endofunctors of cartesian closed categories (Q4279245) (← links)
- Building domains from graph models (Q4279258) (← links)
- Categorical data types in parametric polymorphism (Q4286531) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- Two remarks on the Lifschitz realizability topos (Q4879901) (← links)
- The S-replete construction (Q5057468) (← links)
- The convex powerdomain in a category of posets realized by cpos (Q5057469) (← links)
- A proposed categorical semantics for ML modules (Q5057478) (← links)
- (Q5091148) (← links)
- From term models to domains (Q5096213) (← links)
- Relational Parametricity for Control Considered as a Computational Effect (Q5262944) (← links)
- Typed equivalence, type assignment, and type containment (Q5881295) (← links)
- Semantics of constructions. I: The traditional approach (Q5934287) (← links)
