Skip to content
This repository was archived by the owner on Jul 28, 2023. It is now read-only.

References

Jump to bottom
intsuc edited this page Jun 19, 2022 · 17 revisions

Papers

1985

  • Augustsson, L. Compiling Pattern Matching. FPCA.

2001

  • Le Fessant, F., & Maranget, L. Optimizing pattern matching. ICFP '01.

2006

  • Goguen, H., McBride, C., & McKinna, J. Eliminating Dependent Pattern Matching. Essays Dedicated to Joseph A. Goguen.
  • Levy, P.B. Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation, 19, 377-414.

2008

  • Maranget, L. Compiling pattern matching to good decision trees. ML '08.

2011

  • Jones, R.E., Hosking, A., & Moss, J.E. The Garbage Collection Handbook: The art of automatic memory management. Chapman and Hall / CRC Applied Algorithms and Data Structures Series.

2017

  • Yang, Y., & Oliveira, B.C. Unifying typing and subtyping. Proceedings of the ACM on Programming Languages, 1, 1 - 26.
  • Nuyts, A., Vezzosi, A., & Devriese, D. Parametric quantifiers for dependent type theory. Proceedings of the ACM on Programming Languages, 1, 1 - 29.
  • Eisenberg, R.A., & PEYTON JONES, S. Levity polymorphism. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation.
  • Asenov, D., Guenat, B., Müller, P., & Otth, M. Precise Version Control of Trees with Line-Based Version Control Systems. FASE.

2018

  • Muehlboeck, F., & Tate, R. Empowering union and intersection types with integrated subtyping. Proceedings of the ACM on Programming Languages, 2, 1 - 29.

2019

  • Winterhalter, T., Sozeau, M., & Tabareau, N. Eliminating reflection from type theory. Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs.

2020

  • Pédrot, P., & Tabareau, N. The fire triangle: how to mix substitution, dependent elimination, and effects. Proceedings of the ACM on Programming Languages, 4, 1 - 28.
  • Cockx, J., & Abel, A. Elaborating dependent (co)pattern matching: No pattern left behind. Journal of Functional Programming, 30.
  • Kokke, W., Siek, J.G., & Wadler, P. Programming language foundations in Agda. Sci. Comput. Program., 194, 102440.
  • Mokhov, A., Mitchell, N., & PEYTON JONES, S. Build systems à la carte: Theory and practice. Journal of Functional Programming, 30.
  • Downen, P., Ariola, Z.M., Jones, S.L., & Eisenberg, R.A. Kinds are calling conventions. Proceedings of the ACM on Programming Languages, 4, 1 - 29.

2021

  • Willsey, M., Nandi, C., Wang, Y.R., Flatt, O., Tatlock, Z., & Panchekha, P. egg: Fast and extensible equality saturation. Proceedings of the ACM on Programming Languages, 5, 1 - 29.
  • Dunfield, J., & Krishnaswami, N.R. Bidirectional Typing. ACM Computing Surveys (CSUR), 54, 1 - 38.
  • Cockx, J., Tabareau, N., & Winterhalter, T. The taming of the rew: a type theory with computational assumptions. Proceedings of the ACM on Programming Languages, 5, 1 - 29.
  • Moon, B., Eades, H.D., & Orchard, D.A. Graded Modal Dependent Type Theory. Programming Languages and Systems, 12648, 462 - 490.

2022

  • Castagna, G., Laurent, M., Nguyễn, K., & Lutze, M. On type-cases, union elimination, and occurrence typing. Proceedings of the ACM on Programming Languages, 6, 1 - 31.
  • Xie, N., Pickering, M., Löh, A., Wu, N., Yallop, J., & Wang, M. Staging with class: a specification for typed template Haskell. Proceedings of the ACM on Programming Languages, 6, 1 - 30.
  • Brachthäuser, J.I., Schuster, P., Lee, E., & Boruch-Gruszecki, A. Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back. Proceedings of the ACM on Programming Languages, 6, 1 - 30.
  • Marshall, D., Vollmer, M., & Orchard, D.A. Linearity and Uniqueness: An Entente Cordiale. ESOP.

Others

Clone this wiki locally