Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. - Michael D. Adams 001; David S. Wise (Memory System Performance and Correctness, 2006)

Fast additions on masked integers. - Michael D. Adams 001; David S. Wise (ACM SIGPLAN Notices, 2006)

Representation-transparent matrix algorithms with scalable performance. - Peter Gottschling; David S. Wise; Michael D. Adams 001 (ICS, 2007)

Efficient nondestructive equality checking for trees and graphs. - Michael D. Adams 001; R. Kent Dybvig (ICFP, 2008)

Scrap your zippers: a generic zipper for heterogeneous types. - Michael D. Adams 001 (ICFP-WGP, 2010)

PPP over Ethernet (PPPoE) Extensions for Credit Flow and Link Metrics. - Bo Berry; Stan Ratliff; Ed Paradise; Tim Kaiser; Michael D. Adams 001 (RFC, 2010)

Flow-sensitive type recovery in linear-log time. - Michael D. Adams 001; Andrew W. Keep; Jan Midtgaard; Matthew Might; Arun Chauhan 001; R. Kent Dybvig (OOPSLA, 2011)

Template your boilerplate: using template haskell for efficient generic programming. - Michael D. Adams 001; Thomas DuBuisson (Haskell, 2012)

A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. - Jan Midtgaard; Michael D. Adams 001; Matthew Might (SAS, 2012)

Principled parsing for indentation-sensitive languages: revisiting landin's offside rule. - Michael D. Adams 001 (POPL, 2013)

Application of Cybernetics and Control Theory for a New Paradigm in Cybersecurity. - Michael D. Adams 001; Seth D. Hitefield; Bruce Hoy; Michael C. Fowler; T. Charles Clancy (CoRR, 2013)

Indentation-sensitive parsing for Parsec. - Michael D. Adams 001; Ömer S. Agacan (Haskell, 2014)

Optimizing SYB is easy! - Michael D. Adams 001; Andrew Farmer; José Pedro Magalhães (PEPM, 2014)

Towards the Essence of Hygiene. - Michael D. Adams 001 (POPL, 2015)

Optimizing SYB traversals is easy! - Michael D. Adams 001; Andrew Farmer; José Pedro Magalhães (Sci. Comput. Program., 2015)

Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis. - Thomas Gilray; Michael D. Adams 001; Matthew Might (ICFP, 2016)

On the complexity and performance of parsing with derivatives. - Michael D. Adams 001; Celeste Hollenbeck; Matthew Might (PLDI, 2016)

Pushdown control-flow analysis for free. - Thomas Gilray; Steven Lyde; Michael D. Adams 001; Matthew Might; David Van Horn (POPL, 2016)

Specifying and executing optimizations for generalized control flow graphs. - William Mansky; Elsa L. Gunter; Dennis Griffith; Michael D. Adams 001 (Sci. Comput. Program., 2016)

Restricting grammars with tree automata. - Michael D. Adams 001; Matthew Might (Proc. ACM Program. Lang., 2017)

Abstract allocation as a unified approach to polyvariance in control-flow analyses. - Thomas Gilray; Michael D. Adams 001; Matthew Might (J. Funct. Program., 2018)

Demand Control-Flow Analysis. - Kimball Germane; Jay McCarthy; Michael D. Adams 001; Matthew Might (VMCAI, 2019)

Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap. - Kimball Germane; Michael D. Adams 001 (ESOP, 2020)

Parsing with zippers (functional pearl). - Pierce Darragh; Michael D. Adams 001 (Proc. ACM Program. Lang., 2020)

Proceedings of the 2020 Scheme and Functional Programming Workshop. - Baptiste Saleil; Michael D. Adams 001 (CoRR, 2021)

Grove: A Bidirectionally Typed Collaborative Structure Editor Calculus. - Michael D. Adams 001; Eric Griffis; Thomas Porter; Sundara Vishnu Satish; Eric Zhao 006; Cyrus Omar (Proc. ACM Program. Lang., 2025)