scientific article; zbMATH DE number 431762
From MaRDI portal
Publication:3138538
Recommendations
Cited in
(27)- Recursive coalgebras from comonads
- The convex powerdomain in a category of posets realized by cpos
- A presentation of the initial lift-algebra
- Two models of synthetic domain theory
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
- Game-theoretic analysis of call-by-value computation
- A convenient category of domains
- Some Domain Theory and Denotational Semantics in Coq
- Games and full abstraction for FPC.
- Topology, domain theory and theoretical computer science
- Parametrized fixed points and their applications to session types
- The bicategory-theoretic solution of recursive domain equations
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- The equational logic of fixed points
- Computational adequacy for recursive types in models of intuitionistic set theory
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- scientific article; zbMATH DE number 7453968 (Why is no real title available?)
- Induction and recursion on the partial real line with applications to Real PCF
- Structural induction and coinduction in a fibrational setting
- Fixpoint operators for domain equations
- Coalgebraic semantics for nominal automata
- Algebraically compact functors
- Equational properties of iteration in algebraically complete categories
- Unique, guarded fixed points in an additive setting: extended abstract
- Initial algebras of terms with binding and algebraic structure
- Computational adequacy via ‘mixed’ inductive definitions
- scientific article; zbMATH DE number 1058158 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138538)
