Type algebras, functor categories and block structure
Algebraic methods in semantics
Journal of Combinatorial Theory Series A
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
The adjoints to the derivative functor on species
Journal of Combinatorial Theory Series A
Colored species, c-monoids, and plethysm, I
Journal of Combinatorial Theory Series A
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding for Linear Binders
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Isomorphisms of generic recursive polynomial types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The differential Lambda-calculus
Theoretical Computer Science
Monoidal Indeterminates and Categories of Possible Worlds
Electronic Notes in Theoretical Computer Science (ENTCS)
Differential structure in models of multiplicative biadditive intuitionistic linear logic
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A foundation for GADTs and inductive families: dependent polynomial functor approach
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
Data Types with Symmetries and Polynomial Functors over Groupoids
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of course, should be taken in conjunction with the well-established views and methods stemming from algebra, category theory, domain theory, logic, type theory, etc. In support of this proposal I will show how such an approach leads to interesting connections between various areas of computer science and mathematics; concentrating on one such example in some detail. Specifically, I will consider the line of my research involving denotational models of the pi calculus and algebraic theories with variable-binding operators, indicating how the abstract mathematical structure underlying these models fits with that of Joyal's combinatorial species of structures. This analysis suggests both the unification and generalisation of models, and in the latter vein I will introduce generalised species of structures and their calculus. These generalised species encompass and generalise various of the notions of species used in combinatorics. Furthermore, they have a rich mathematical structure (akin to models of Girard's linear logic) that can be described purely within Lawvere's generalised logic. Indeed, I will present and treat the cartesian closed structure, the linear structure, the differential structure, etc. of generalised species axiomatically in this mathematical framework. As an upshot, I will observe that the setting allows for interpretations of computational calculi (like the lambda calculus, both typed and untyped; the recently introduced differential lambda calculus of Ehrhard and Regnier; etc) that can be directly seen as translations into a more basic elementary calculus of interacting agents that compute by communicating and operating upon structured data.