Neil Ghani

Jérémy Ledent

Proceedings of the Fourth International Conference on Applied Category Theory, 2021

2020

Compositional Game Theory, Compositionally.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Three equivalent ordinal notation systems in cubical Agda.

[BibT_eX]

[DOI]

Chuangjie Xu

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019

Universal properties for universal types in bifibrational parametricity.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

Compositional Game Theory with Mixed Strategies: Probabilistic Open Games Using a Distributive Law.

[BibT_eX]

[DOI]

Clemens Kupke

Alasdair Lambert

Proceedings of the Proceedings Applied Category Theory 2019, 2019

2018

A compositional treatment of iterated open games.

[BibT_eX]

[DOI]

Clemens Kupke

Alasdair Lambert

Theor. Comput. Sci., 2018

Compositional Game Theory.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Variations on Inductive-Recursive Definitions.

[BibT_eX]

[DOI]

Stephan Spahn

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Polytypic Genetic Programming.

[BibT_eX]

[DOI]

Jerry Swan

Krzysztof Krawiec

Proceedings of the Applications of Evolutionary Computation - 20th European Conference, 2017

2016

Containers, monads and induction recursion.

[BibT_eX]

[DOI]

Peter G. Hancock

Math. Struct. Comput. Sci., 2016

A compositional approach to economic game theory.

[BibT_eX]

[DOI]

Jules Hedges

CoRR, 2016

Comprehensive Parametric Polymorphism: Categorical Models and Type Theory.

[BibT_eX]

[DOI]

Alex Simpson

Proceedings of the Foundations of Software Science and Computation Structures, 2016

Dependent Types and Fibred Computational Effects.

[BibT_eX]

[DOI]

Danel Ahman

Gordon D. Plotkin

Proceedings of the Foundations of Software Science and Computation Structures, 2016

Proof-Relevant Parametricity.

[BibT_eX]

[DOI]

Proceedings of the A List of Successes That Can Change the World, 2016

2015

Indexed containers.

[BibT_eX]

[DOI]

J. Funct. Program., 2015

Bifibrational Functorial Semantics of Parametric Polymorphism.

[BibT_eX]

[DOI]

Tim Revell

Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Positive Inductive-Recursive Definitions.

[BibT_eX]

[DOI]

Lorenzo Malatesta

Log. Methods Comput. Sci., 2015

Parametric Polymorphism - Universally.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2015

Models for Polymorphism over Physical Dimension.

[BibT_eX]

[DOI]

Timothy Revell

Sam Staton

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2014

A relationally parametric model of dependent type theory.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013

Indexed Induction and Coinduction, Fibrationally.

[BibT_eX]

[DOI]

Clément Fumex

Log. Methods Comput. Sci., 2013

Small Induction Recursion.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

Fibred Data Types.

[BibT_eX]

[DOI]

Lorenzo Malatesta

Anton Setzer

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Generic Fibrational Induction

[BibT_eX]

[DOI]

Clément Fumex

Log. Methods Comput. Sci., 2012

Refining Inductive Types

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Fibrational Induction Meets Effects.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011

When Is a Type Refinement an Inductive Type?

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010

Fibrational Induction Rules for Initial Algebras.

[BibT_eX]

[DOI]

Clément Fumex

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

A principled approach to programming with nested types in Haskell.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2009

A Universe of Strictly Positive Families.

[BibT_eX]

[DOI]

Peter Morris

Int. J. Found. Comput. Sci., 2009

Representations of Stream Processors Using Nested Fixed Points

[BibT_eX]

[DOI]

Peter G. Hancock

Dirk Pattinson

Log. Methods Comput. Sci., 2009

2008

Modularity and Implementation of Mathematical Operational Semantics.

[BibT_eX]

[DOI]

Mauro Jaskelioff

Graham Hutton

Proceedings of the Second Workshop on Mathematically Structured Functional Programming, 2008

Short Cut Fusion for Effects.

[BibT_eX]

Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

Foundations for structured programming with GADTs.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Proving Properties about Lists Using Containers.

[BibT_eX]

[DOI]

Rawle C. S. Prince

Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

2007

Monadic augment and generalised short cut fusion.

[BibT_eX]

[DOI]

J. Funct. Program., 2007

Initial Algebra Semantics Is Enough!

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

Constructing Strictly Positive Families.

[BibT_eX]

[DOI]

Peter Morris

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Higher Dimensional Trees, Algebraically.

[BibT_eX]

[DOI]

Alexander Kurz

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Explicit substitutions and higher-order syntax.

[BibT_eX]

[DOI]

Makoto Hamana

High. Order Symb. Comput., 2006

String rewriting for double coset systems.

[BibT_eX]

[DOI]

Ronald Brown

Anne Heyworth

Christopher D. Wensley

J. Symb. Comput., 2006

Preface.

[BibT_eX]

[DOI]

John Power

Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

Continuous Functions on Final Coalgebras.

[BibT_eX]

[DOI]

Peter G. Hancock

Dirk Pattinson

Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

2005

Containers: Constructing strictly positive types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Monads of coalgebras: rational terms and term graphs.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

for Data: Differentiating Data Structures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Abstract Modularity.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Monadic augment and generalised short cut fusion.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

2004

Coproducts of Ideal Monads.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

Difunctorial Semantics of Object Calculus.

[BibT_eX]

[DOI]

Johan Glimming

Proceedings of the Second Workshop on Object Oriented Developments, 2004

Relationally Staged Computations in Calculi of Mobile Processes.

[BibT_eX]

[DOI]

Kidane Yemane

Björn Victor

Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Generalizing the AUGMENT combinator.

[BibT_eX]

Varmo Vene

Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

Constructing Polymorphic Programs with Quotient Types.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

Representing Nested Inductive Types Using W-Types.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Build, Augment and Destroy, Universally.

[BibT_eX]

[DOI]

Varmo Vene

Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003

Rewriting Via Coinserters.

[BibT_eX]

Nord. J. Comput., 2003

Dualising Initial Algebras.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2003

Solving Algebraic Equations Using Coalgebra.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

Derivatives of Containers.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

A Rewriting Alternative to Reidemeister-Schreier.

[BibT_eX]

[DOI]

Anne Heyworth

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Explicit substitutions and higher-order syntax.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Categories of Containers.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

Coproducts of Ideal Monads (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the FICS '03, 2003

2002

Coalgebraic Monads.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2002

Computing over K-modules.

[BibT_eX]

[DOI]

Anne Heyworth

Proceedings of the Computing: the Australasian Theory Symposium, 2002

Composing monads using coproducts.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Monads and Modularity.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

Coalgebraic approaches to algebraic terms.

[BibT_eX]

Proceedings of the Fixed Points in Computer Science, 2002

2001

Algebras, Coalgebras, Monads and Comonads.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2001

2000

Linear Explicit Substitutions.

[BibT_eX]

[DOI]

Valeria de Paiva

Eike Ritter

Log. J. IGPL, 2000

1999

Categorical Models of Explicit Substitutions.

[BibT_eX]

[DOI]

Valeria de Paiva

Eike Ritter

Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998

Explicit Substitutions for Constructive Necessity.

[BibT_eX]

[DOI]

Valeria de Paiva

Eike Ritter

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Eta-Expansions in Dependent Type Theory - The Calculus of Constructions.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1997

On Modular Properties of Higher Order Extensional Lambda Calculi.

[BibT_eX]

[DOI]

Roberto Di Cosmo

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Monads and Modular Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996

Eta-Expansions in F<sup>omega</sup>.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

The Virtues of Eta-Expansion.

[BibT_eX]

[DOI]

C. Barry Jay

J. Funct. Program., 1995

ßn-Equality for Coproducts.

[BibT_eX]

[DOI]