The following pages link to (Q3978971):
Displaying 50 items.
- A note on ``Extensional PERs'' (Q615886) (← links)
- A general theory of self-similarity (Q626101) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- A presentation of the initial lift-algebra (Q678845) (← links)
- Introduction: A personal tribute to Peter Freyd and Bill Lawvere (Q680307) (← links)
- Characterizing categories of algebras (Q800476) (← links)
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure (Q890383) (← links)
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic (Q952487) (← links)
- Generalized algebraic theories and contextual categories (Q1096716) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
- Algebraically compact functors (Q1208195) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- A co-induction principle for recursively defined domains (Q1318702) (← links)
- Partial map classifiers and partial cartesian closed categories (Q1349664) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Semantics and logic of object calculi (Q1434358) (← links)
- Axioms and (counter)examples in synthetic domain theory (Q1577485) (← links)
- On the canonical algebraic structure of a category (Q1588070) (← links)
- Fixpoint operators for domain equations (Q1605186) (← links)
- Fixed points of Scott continuous self-maps (Q1609606) (← links)
- Exact completion of path categories and algebraic set theory. I: Exact completion of path categories (Q1748403) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Recursive data types in algebraically \(\omega\)-complete categories (Q1892884) (← links)
- Categories of algebraic sets (Q1923807) (← links)
- Pseudocompact algebras and highest weight categories (Q1956366) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Parametrized fixed points and their applications to session types (Q2133474) (← links)
- Relative full completeness for bicategorical Cartesian closed structure (Q2200828) (← links)
- Weighted models for higher-order computation (Q2216134) (← links)
- Terminal coalgebras in well-founded set theory (Q2367542) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- Recursive coalgebras from comonads (Q2495640) (← links)
- Unique, guarded fixed points in an additive setting: extended abstract (Q2842814) (← links)
- A convenient category of domains (Q2864147) (← links)
- Least and Greatest Fixpoints in Game Semantics (Q3617718) (← links)
- ESSENTIALLY ALGEBRAIC CATEGORIES (Q3743466) (← links)
- T.T.F. theories in abelian categories (Q3797363) (← links)
- A T.T.F. theory for short exact sequences (Q3797364) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- How complete are categories of algebras? (Q4724807) (← links)
- <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
- (Q5009709) (← links)
- (Q5020949) (← links)
- The S-replete construction (Q5057468) (← links)
- The convex powerdomain in a category of posets realized by cpos (Q5057469) (← links)
- Categorical fixed point calculus (Q5057473) (← links)
