Two applications of analytic functors
From MaRDI portal
Publication:5958294
DOI10.1016/S0304-3975(00)00349-2zbMath0984.68030MaRDI QIDQ5958294
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Minimal bad sequences are necessary for a uniform Kruskal theorem, Bialgebras in Rel, Data Types with Symmetries and Polynomial Functors over Groupoids, A quantum double construction in Rel, Semantics of higher-order quantum computation via geometry of interaction, Fixed points and Noetherian topologies, The Scott model of linear logic is the extensional collapse of its relational model, Differential 2-rigs, Mackey-complete spaces and power series – a topological model of differential linear logic, Unnamed Item, Some reasons for generalising domain theory, Analytic functors between presheaf categories over groupoids, A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets, Containers, monads and induction recursion, Initial Algebra Semantics for Cyclic Sharing Structures, Extending set functors to generalised metric spaces, From Kruskal’s theorem to Friedman’s gap condition, Containers: Constructing strictly positive types, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, A Quillen Adjunction Between Algebras and Operads, Koszul Duality, and the Lagrange Inversion Formula
Cites Work
- Orderings for term-rewriting systems
- The Lagrange-Good inversion formula and its application to integral equations
- A consistency proof of a system including Feferman's \(ID_{\xi}\) by Takeuti's reduction method
- Normal functors, power series and \(\lambda\)-calculus
- A combinatorial proof of the multivariable Lagrange inversion formula
- A new system of proof-theoretic ordinal functions
- Une théorie combinatoire des séries formelles
- On asymmetric structures
- LCF considered as a programming language
- Braided tensor categories
- Logic, language and computation. Festschrift in Honor of Satoru Takasu
- A bijective proof of infinite variated Good's inversion
- Terminal coalgebras in well-founded set theory
- An extension of Schütte's Klammersymbole
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse
- Ordinal numbers and the Hilbert basis theorem
- Proving termination with multiset orderings
- Π12-logic, Part 1: Dilators
- Reversion of power series and the extended Raney coefficients
- Reversion of power series by residues
- Traced monoidal categories
- Quantitative domains, groupoids and linear logic
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
- Proof theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
