• Alves S, Kesner D and Ramos M. Extending the Quantitative Pattern-Matching Paradigm. Programming Languages and Systems. (84-105).

    https://doi.org/10.1007/978-981-97-8943-6_5

  • Hu J and Pientka B. Layered Modal Type Theory. Programming Languages and Systems. (52-82).

    https://doi.org/10.1007/978-3-031-57262-3_3

  • Rioux N, Huang X, Oliveira B and Zdancewic S. (2023). A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈. Proceedings of the ACM on Programming Languages. 7:POPL. (515-543). Online publication date: 9-Jan-2023.

    https://doi.org/10.1145/3571211

  • COCKX J and ABEL A. (2020). Elaborating dependent (co)pattern matching: No pattern left behind. Journal of Functional Programming. 10.1017/S0956796819000182. 30.

    https://www.cambridge.org/core/product/identifier/S0956796819000182/type/journal_article

  • Cockx J and Abel A. (2018). Elaborating dependent (co)pattern matching. Proceedings of the ACM on Programming Languages. 2:ICFP. (1-30). Online publication date: 30-Jul-2018.

    https://doi.org/10.1145/3236770

  • Devesas Campos M and Levy P. (2018). A Syntactic View of Computational Adequacy. Foundations of Software Science and Computation Structures. 10.1007/978-3-319-89366-2_4. (71-87).

    http://link.springer.com/10.1007/978-3-319-89366-2_4

  • Laforgue P and Régis-Gianas Y. Copattern matching and first-class observations in OCaml, with a macro. Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming. (97-108).

    https://doi.org/10.1145/3131851.3131869

  • Thibodeau D, Cave A and Pientka B. (2016). Indexed codata types. ACM SIGPLAN Notices. 51:9. (351-363). Online publication date: 5-Dec-2016.

    https://doi.org/10.1145/3022670.2951929

  • Thibodeau D, Cave A and Pientka B. Indexed codata types. Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming. (351-363).

    https://doi.org/10.1145/2951913.2951929

  • Chaudhuri K, Marin S and Straßburger L. (2016). Focused and Synthetic Nested Sequents. Foundations of Software Science and Computation Structures. 10.1007/978-3-662-49630-5_23. (390-407).

    http://link.springer.com/10.1007/978-3-662-49630-5_23

  • Scherer G and Rémy D. (2015). Which simple types have a unique inhabitant?. ACM SIGPLAN Notices. 50:9. (243-255). Online publication date: 18-Dec-2015.

    https://doi.org/10.1145/2858949.2784757

  • Graham-Lengrand S. (2015). Realisability semantics of abstract focussing, formalised. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.197.3. 197. (15-28).

    http://arxiv.org/abs/1511.04179

  • Scherer G and Rémy D. Which simple types have a unique inhabitant?. Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming. (243-255).

    https://doi.org/10.1145/2784731.2784757

  • Simmons R. (2014). Structural Focalization. ACM Transactions on Computational Logic. 15:3. (1-33). Online publication date: 8-Jul-2014.

    https://doi.org/10.1145/2629678

  • Abel A, Pientka B, Thibodeau D and Setzer A. (2013). Copatterns. ACM SIGPLAN Notices. 48:1. (27-38). Online publication date: 23-Jan-2013.

    https://doi.org/10.1145/2480359.2429075

  • Abel A, Pientka B, Thibodeau D and Setzer A. Copatterns. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (27-38).

    https://doi.org/10.1145/2429069.2429075

  • Houtmann C. (2011). Superdeduction in Lambda-Bar-Mu-Mu-Tilde. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.47.5. 47. (34-43).

    http://arxiv.org/abs/1101.5443v1

  • Brock-Nannestad T and Schürmann C. Focused natural deduction. Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning. (157-171).

    /doi/10.5555/1928380.1928392

  • Zeilberger N. Polarity and the Logic of Delimited Continuations. Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science. (219-227).

    https://doi.org/10.1109/LICS.2010.23

  • Brock-Nannestad T and Schürmann C. (2010). Focused Natural Deduction. Logic for Programming, Artificial Intelligence, and Reasoning. 10.1007/978-3-642-16242-8_12. (157-171).

    http://link.springer.com/10.1007/978-3-642-16242-8_12

  • Harper R, Licata D and Zeilberger N. A Pronominal Approach to Binding and Computation. Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications. (3-4).

    https://doi.org/10.1007/978-3-642-02273-9_2

  • Krishnaswami N. (2009). Focusing on pattern matching. ACM SIGPLAN Notices. 44:1. (366-378). Online publication date: 21-Jan-2009.

    https://doi.org/10.1145/1594834.1480927

  • Krishnaswami N. Focusing on pattern matching. Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (366-378).

    https://doi.org/10.1145/1480881.1480927

  • Zeilberger N. Refinement types and computational duality. Proceedings of the 3rd workshop on Programming languages meets program verification. (15-26).

    https://doi.org/10.1145/1481848.1481852

  • Licata D and Harper R. Positively dependent types. Proceedings of the 3rd workshop on Programming languages meets program verification. (3-14).

    https://doi.org/10.1145/1481848.1481851

  • Licata D, Zeilberger N and Harper R. Focusing on Binding and Computation. Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science. (241-252).

    https://doi.org/10.1109/LICS.2008.48

  • Rioux N and Zdancewic S. (2020). Computation focusing. Proceedings of the ACM on Programming Languages. 4:ICFP. (1-27). Online publication date: 2-Aug-2020.

    https://doi.org/10.1145/3408977