Notions of computation and monads
Information and Computation
Using functor categories to generate intermediate code
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Domains
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
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A fully abstract model for the π-calculus
Information and Computation
Algebraic specifications: some old history and new thoughts
Nordic Journal of Computing
Complete Cuboidal Sets in Axiomatic Domain Theory
LICS '97 Proceedings of the 12th 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
Journal of Functional Programming
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
On the construction of free algebras for equational systems
Theoretical Computer Science
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
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
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Polymorphic abstract syntax via Grothendieck construction
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A foundation for GADTs and inductive families: dependent polynomial functor approach
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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 |
We study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. The main theoretical contribution is the introduction of discrete generalised polynomial functors, a class that lies in between the classes of cocontinuous and finitary functors, and is closed under composition, sums, finite products, and differentiation. A variety of applications are given: to the theory of nominal algebraic effects; to the algebraic modelling of languages, and equational theories there of, with variable binding and polymorphism; and to the synthesis of dependent zippers.