Michael D. Adams

According to our database1, Michael D. Adams authored at least 25 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Proceedings of the 2020 Scheme and Functional Programming Workshop.
CoRR, 2021

Parsing with zippers (functional pearl).
Proc. ACM Program. Lang., 2020

Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap.
Proceedings of the Programming Languages and Systems, 2020

Demand Control-Flow Analysis.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

Abstract allocation as a unified approach to polyvariance in control-flow analyses.
J. Funct. Program., 2018

Restricting grammars with tree automata.
Proc. ACM Program. Lang., 2017

Specifying and executing optimizations for generalized control flow graphs.
Sci. Comput. Program., 2016

Pushdown control-flow analysis for free.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

On the complexity and performance of parsing with derivatives.
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016

Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Optimizing SYB traversals is easy!
Sci. Comput. Program., 2015

Towards the Essence of Hygiene.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Optimizing SYB is easy!
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

Indentation-sensitive parsing for Parsec.
Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

Application of Cybernetics and Control Theory for a New Paradigm in Cybersecurity.
CoRR, 2013

Principled parsing for indentation-sensitive languages: revisiting landin's offside rule.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Template your boilerplate: using template haskell for efficient generic programming.
Proceedings of the 5th ACM SIGPLAN Symposium on Haskell, 2012

Flow-sensitive type recovery in linear-log time.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

PPP over Ethernet (PPPoE) Extensions for Credit Flow and Link Metrics.
RFC, February, 2010

Scrap your zippers: a generic zipper for heterogeneous types.
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2010

Efficient nondestructive equality checking for trees and graphs.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

Representation-transparent matrix algorithms with scalable performance.
Proceedings of the 21th Annual International Conference on Supercomputing, 2007

Fast additions on masked integers.
ACM SIGPLAN Notices, 2006

Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms.
Proceedings of the 2006 workshop on Memory System Performance and Correctness, 2006