References

  1. Michael Abbott, Thorsten Altenkirch & Neil Ghani (2003): Categories of Containers. In: Andrew D. Gordon: Foundations of Software Science and Computation Structures. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 23–38, doi:10.1007/3-540-36576-1_2.
  2. Michael Abbott, Thorsten Altenkirch & Neil Ghani (2004): Representing Nested Inductive Types Using W-Types. In: Josep Díaz, Juhani Karhumäki, Arto Lepistö & Donald Sannella: Automata, Languages and Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 59–71, doi:10.1007/978-3-540-27836-8_8.
  3. Michael Abbott, Thorsten Altenkirch & Neil Ghani (2005): Containers: Constructing Strictly Positive Types. Theor. Comput. Sci. 342(1), pp. 327, doi:10.1016/j.tcs.2005.06.002.
  4. Michael Abbott, Thorsten Altenkirch, Neil Ghani & Conor McBride (2003): Derivatives of Containers. In: Martin Hofmann: Typed Lambda Calculi and Applications. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 16–30, doi:10.1007/3-540-44904-3_2.
  5. R. Bernecky (1987): An Introduction to Function Rank. SIGAPL APL Quote Quad 18(2), pp. 3943, doi:10.1145/377719.55632.
  6. Y-Lan Boureau, Jean Ponce & Yann LeCun (2010): A Theoretical Analysis of Feature Pooling in Visual Recognition. In: Proceedings of the 27th International Conference on International Conference on Machine Learning, ICML10. Omnipress, Madison, WI, USA, pp. 111118.
  7. Tim Freeman & Frank Pfenning (1991): Refinement Types for ML. SIGPLAN Not. 26(6), pp. 268277, doi:10.1145/113446.113468.
  8. Susumu Hayashi (1994): Logic of refinement types. In: Henk Barendregt & Tobias Nipkow: Types for Proofs and Programs. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 108–126, doi:10.1007/3-540-58085-9_74.
  9. Kenneth E. Iverson (1962): A Programming Language. John Wiley & Sons, Inc., New York, NY, USA, doi:10.1145/1460833.1460872.
  10. C Barry Jay & Paul A Steckler (1998): The functional imperative: shape!. In: European Symposium on Programming. Springer, pp. 139–153, doi:10.1007/BFb0053568.
  11. Sven-Bodo Scholz (2003): Single Assignment C: Efficient Support for High-level Array Operations in a Functional Setting. J. Funct. Program. 13(6), pp. 1005–1059, doi:10.1017/S0956796802004458.
  12. Artjoms Šinkarovs (2020): Arrays with Levels in Agda. https://github.com/ashinkarov/agda-arrays-with-levels. [Accessed: March 2020].
  13. Justin Slepak, Olin Shivers & Panagiotis Manolios (2014): An Array-Oriented Language with Static Rank Polymorphism. In: Zhong Shao: Programming Languages and Systems. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 27–46, doi:10.1007/978-3-642-54833-8_3.
  14. Roger Stokes (15 June 2015): Learning J. An Introduction to the J Programming Language. http://www.jsoftware.com/help/learning/contents.htm. [Accessed: March 2020].
  15. Kai Trojahner & Clemens Grelck (2009): Dependently typed array programs don't go wrong. The Journal of Logic and Algebraic Programming 78(7), pp. 643 – 664, doi:10.1016/j.jlap.2009.03.002. The 19th Nordic Workshop on Programming Theory (NWPT 2007).
  16. Arthur Whitney (2001): K. http://archive.vector.org.uk/art10010830. [Accessed: March 2020].

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org