Paul Downen

J. Funct. Program., 2023

Closure Conversion in Little Pieces.

[BibT_eX]

[DOI]

Zachary J. Sullivan

Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

2022

Introduction and elimination, left and right.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

2021

Classical (Co)Recursion: Programming.

[BibT_eX]

[DOI]

CoRR, 2021

Strictly capturing non-strict closures.

[BibT_eX]

[DOI]

Zachary J. Sullivan

Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2021

Duality in Action (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Kinds are calling conventions.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

Compiling With Classical Connectives.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

Abstracting models of strong normalization for classical calculi.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2020

A Computational Understanding of Classical (Co)Recursion.

[BibT_eX]

[DOI]

Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

2019

The Duality of Classical Intersection and Union Types.

[BibT_eX]

[DOI]

Silvia Ghilezan

Fundam. Informaticae, 2019

Making a faster Curry with extensional types.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019

Codata in Action.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2019

2018

A tutorial on computational classical logic and the sequent calculus.

[BibT_eX]

[DOI]

J. Funct. Program., 2018

Uniform Strong Normalization for Multi-discipline Calculi.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing.

[BibT_eX]

[DOI]

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Call-by-name extensionality and confluence.

[BibT_eX]

[DOI]

J. Funct. Program., 2017

Compiling without continuations.

[BibT_eX]

[DOI]

Luke Maurer

Simon L. Peyton Jones

Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

2016

Sequent calculus as a compiler intermediate language.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015

First Class Call Stacks: Exploring Head Reduction.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Continuations, 2015

Structures for structural recursion.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2014

Delimited control and computational effects.

[BibT_eX]

[DOI]

J. Funct. Program., 2014

Continuations, Processes, and Sharing.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Compositional semantics for composable continuations: from abortive to delimited control.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

The Duality of Construction.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2014

2012

Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

A Systematic Approach to Delimited Control with Multiple Prompts.

[BibT_eX]

[DOI]