Michael D. Adams. Flow-Sensitive Control-Flow Analysis in Linear-Log Time. Ph.D. thesis, Indiana University, 2011.

Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, and R. Kent Dybvig. Flow-sensitive sub-zero control-flow analysis in linear-log time. In Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, OOPSLA ’11, pages 483–498. ACM, New York, NY, USA, 2011. ISBN 978-1-4503-0940-0. doi: 10.1145/2048066.2048105.

Michael D. Adams. Scrap your zippers: A generic zipper for heterogeneous types. In WGP ’10: Proceedings of the 2010 ACM SIGPLAN workshop on Generic programming, pages 13–24. ACM, New York, NY, USA, 2010. ISBN 978-1-4503-0251-7. doi: 10.1145/1863495.1863499.

Andrew W. Keep, Michael D. Adams, Lindsey Kuper, William E. Byrd, and Daniel P. Friedman. A pattern matcher for miniKanren or how to get into trouble with CPS macros. In Scheme ’09: Proceedings of the 2009 Scheme and Functional Programming Workshop, number CPSLO-CSC-09-03 in California Polytechnic State University Technical Report, pages 37–45. 2009. URL http://digitalcommons.calpoly.edu/csse_fac/83/.

Michael D. Adams and R. Kent Dybvig. Efficient nondestructive equality checking for trees and graphs. In ICFP ’08: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, pages 179–188. ACM, New York, NY, USA, 2008. ISBN 978-1-59593-919-7. doi: 10.1145/1411204.1411230.

Peter Gottschling, David S. Wise, and Michael D. Adams. Representation-transparent matrix algorithms with scalable performance. In ICS ’07: Proceedings of the 21st annual international conference on Supercomputing, pages 116–125. ACM, New York, NY, USA, 2007. ISBN 978-1-59593-768-1. doi: 10.1145/1274971.1274989.

Michael D. Adams and David S. Wise. Seven at one stroke: Results from a cache-oblivious paradigm for scalable matrix algorithms. In MSPC ’06: Proceedings of the 2006 workshop on Memory system performance and correctness, pages 41–50. ACM, New York, NY, USA, 2006. ISBN 1-59593-578-9. doi: 10.1145/1178597.1178604.

Michael D. Adams and David S. Wise. Fast additions on masked integers. SIGPLAN Notices, 41(5):39–45, May 2006. ISSN 0362-1340. doi: 10.1145/1149982.1149987.

Michael D. Adams. The representation of constraints, annotations and first class patterns over arbitrary data types in Haskell. Honors Undergraduate Research, University of Kansas, May 2004.