Introduction to higher order categorical logic
Introduction to higher order categorical logic
A combinatorial proof of the multivariable Lagrange inversion formula
Journal of Combinatorial Theory Series A
Graph minors. IV. Tree-width and well-quasi-ordering
Journal of Combinatorial Theory Series B
Graph minors. VIII. A Kuratowski theorem for general surfaces
Journal of Combinatorial Theory Series B
Discrete Mathematics - Special volume: algebraic combinatorics
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
A short course in ordinal analysis
Proof theory
Additions and corrections to “Terminal coalgebras in well-founded set theory”
Theoretical Computer Science
Correspondence between operational and denotational semantics: the full abstraction problem for PCF
Handbook of logic in computer science (vol. 4)
Proving termination with multiset orderings
Communications of the ACM
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
An Analysis of Divisibility Orderings and Recursive Path Orderings
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Quantitative Domains, Groupoids and Linear Logic
Category Theory and Computer Science
Mathematical Structures in Computer Science
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Initial Algebra Semantics for Cyclic Sharing Structures
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Data Types with Symmetries and Polynomial Functors over Groupoids
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
We apply the theory of analytic functors to two topics related to theoretical computer science. One is a mathematical foundation of certain syntactic well-quasi-orders and well-orders appearing in graph theory, the theory of term rewriting systems, and proof theory. The other is a new verification of the Lagrange-Good inversion formula using several ideas appearing in semantics of lambda calculi, especially the relation between categorical traces and fixpoint operators. Copyright 2002 Elsevier Science B.V.