Michael D. Adams and Matthew Might. Restricting grammars with tree automata. Proceedings of the ACM on Programming Languages, 1(OOPSLA):82:1–82:25, October 2017. ISSN 2475-1421. doi: 10.1145/3133906.

William Mansky, Elsa L. Gunter, Dennis Griffith, and Michael D. Adams. Specifying and executing optimizations for generalized control flow graphs. Science of Computer Programming, 130:2–23, November 2016. ISSN 0167-6423. doi: 10.1016/j.scico.2016.06.003.

Thomas Gilray, Michael D. Adams, and Matthew Might. Allocation characterizes polyvariance: A unified methodology for polyvariant control-flow analysis. In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP ’16, pages 407–420. ACM, New York, NY, USA, September 2016. ISBN 978-1-4503-4219-3. doi: 10.1145/2951913.2951936.

Michael D. Adams, Celeste Hollenbeck, and Matthew Might. On the complexity and performance of parsing with derivatives. In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’16. ACM, New York, NY, USA, June 2016. ISBN 978-1-4503-4261-2. doi: 10.1145/2908080.2908128.

Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, and David Van Horn. Pushdown control-flow analysis for free. In Proceedings of the 43nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’16. ACM, New York, NY, USA, January 2016. doi: 10.1145/2837614.2837631.

Michael D. Adams, Andrew Farmer, and José Pedro Magalhães. Optimizing SYB traversals is easy! Science of Computer Programming, 112, Part 2:170–193, November 2015. ISSN 0167-6423. doi: 10.1016/j.scico.2015.09.003.

Michael D. Adams and Matthew Might. Disambiguating grammars with tree automata. In Proceedings of Parsing@SLE. ACM, New York, NY, USA, October 2015.

Michael D. Adams. Towards the essence of hygiene. In Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’15. ACM, New York, NY, USA, January 2015. ISBN 978-1-4503-3300-9. doi: 10.1145/2676726.2677013.

Michael D. Adams and Ömer S. Ağacan. Indentation-sensitive parsing for Parsec. In Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell, Haskell ’14, pages 121–132. ACM, New York, NY, USA, September 2014. ISBN 978-1-4503-3041-1. doi: 10.1145/2633357.2633369.

Michael D. Adams, Andrew Farmer, and José Pedro Magalhães. Optimizing SYB is easy! In Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation, PEPM ’14. ACM, New York, NY, USA, 2014. ISBN 978-1-4503-2619-3. doi: 10.1145/2543728.2543730.

Michael D. Adams. Principled parsing for indentation-sensitive languages: Revisiting Landin’s offside rule. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL ’13, pages 511–522. ACM, New York, NY, USA, 2013. ISBN 978-1-4503-1832-7. doi: 10.1145/2429069.2429129.

Michael D. Adams and Thomas M. DuBuisson. Template your boilerplate: Using Template Haskell for efficient generic programming. In Proceedings of the 2012 ACM SIGPLAN Haskell symposium, Haskell ’12, pages 13–24. ACM, New York, NY, USA, 2012. ISBN 978-1-4503-1574-6. doi: 10.1145/2364506.2364509.

Jan Midtgaard, Michael Adams, and Matthew Might. A structural soundness proof for Shiverss escape technique: A case for Galois connections. In Antoine Miné and David Schmidt, editors, Static Analysis, volume 7460 of Lecture Notes in Computer Science, pages 352–369. Springer Berlin / Heidelberg, 2012. ISBN 978-3-642-33124-4. ISSN 0302-9743 (Print) 1611-3349 (Online). doi: 10.1007/978-3-642-33125-1_24.

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 type recovery 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, October 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

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.

See Also