Noam Zeilberger

CoRR, 2024

On the complexity of normalization for the planar λ-calculus.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Convolution Products on Double Categories and Categorification of Rule Algebras.

[BibT_eX]

[DOI]

Nicolas Behr

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem.

[BibT_eX]

[DOI]

Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

2021

Asymptotic Distribution of Parameters in Trivalent Maps and Linear Lambda Terms.

[BibT_eX]

[DOI]

Olivier Bodini

Alexandros Singh

CoRR, 2021

2020

Proof Theory of Partially Normal Skew Monoidal Categories.

[BibT_eX]

[DOI]

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

Deductive Systems and Coherence for Skew Prounital Closed Categories.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2020

Eilenberg-Kelly Reloaded.

[BibT_eX]

[DOI]

Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Bifibrations of Polycategories and Classical Linear Logic.

[BibT_eX]

[DOI]

Nicolas Blanco

Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

2019

A sequent calculus for a semi-associative law.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Connected Chord Diagrams and Bridgeless Maps.

[BibT_eX]

[DOI]

Julien Courtiel

Karen A. Yeats

Electron. J. Comb., 2019

2018

An Isbell duality theorem for type refinement systems.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

The Sequent Calculus of Skew Monoidal Categories.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

A theory of linear typings as flows on 3-valent graphs.

[BibT_eX]

[DOI]

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

2017

A sequent calculus for the Tamari order.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Linear lambda terms as invariants of rooted trivalent maps.

[BibT_eX]

[DOI]

J. Funct. Program., 2016

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

A correspondence between rooted planar maps and normal planar lambda terms.

[BibT_eX]

[DOI]

Alain Giorgetti

Log. Methods Comput. Sci., 2015

Counting isomorphism classes of $β$-normal linear lambda terms.

[BibT_eX]

[DOI]

CoRR, 2015

Isbell Duality for Refinement Types.

[BibT_eX]

[DOI]

CoRR, 2015

Functors are Type Refinement Systems.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2013

Type refinement and monoidal closed bifibrations.

[BibT_eX]

[DOI]

CoRR, 2013

2010

Polarity and the Logic of Delimited Continuations.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

A Pronominal Approach to Binding and Computation.

[BibT_eX]

[DOI]

Robert Harper

Daniel R. Licata

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Refinement types and computational duality.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, 2009

2008

On the unity of duality.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2008

Focusing and higher-order abstract syntax.

[BibT_eX]

[DOI]

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

Focusing on Binding and Computation.

[BibT_eX]

[DOI]

Daniel R. Licata