Understanding idiomatic traversals backwards and forwards
暂无分享,去创建一个
[1] Richard S. Bird,et al. Nested Datatypes , 1998, MPC.
[2] C. Barry Jay,et al. Monads, shapely functors, and traversals , 1999, CTCS.
[3] Conor McBride,et al. Applicative programming with effects , 2008, J. Funct. Program..
[4] G. Hutton,et al. Chapter 25 Reasoning About Effects : Seeing the Wood Through the Trees , 2008 .
[5] Bruno C. d. S. Oliveira,et al. The essence of the Iterator pattern , 2006, J. Funct. Program..
[6] GibbonsJeremy,et al. The essence of the iterator pattern , 2009 .
[7] Joyce L. Vedral,et al. Functional Programming Languages and Computer Architecture , 1989, Lecture Notes in Computer Science.
[8] F. Pearl,et al. Free Theorems Involving Type Constructor Classes , 2008 .
[9] Jean-Yves Girard,et al. Normal functors, power series and λ-calculus , 1988, Ann. Pure Appl. Log..
[10] Philip Wadler,et al. Theorems for free! , 1989, FPCA.
[11] Janis Voigtländer. Free theorems involving type constructor classes: functional pearl , 2009, ICFP.
[12] Mauro Jaskelioff,et al. An Investigation of the Laws of Traversals , 2012, MSFP.
[13] Ambrus Kaposi,et al. Free Applicative Functors , 2014, MSFP.
[14] Martin Hyland,et al. Wellfounded Trees and Dependent Polynomial Functors , 2003, TYPES.