Michael D. Adams

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Proceedings of the 2020 Scheme and Functional Programming Workshop.

Baptiste Saleil, Michael D. Adams

CoRR, 2021

2020

Parsing with zippers (functional pearl).

Pierce Darragh, Michael D. Adams

Proc. ACM Program. Lang., 2020

Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap.

Kimball Germane, Michael D. Adams

Proceedings of the Programming Languages and Systems, 2020

2019

Demand Control-Flow Analysis.

Kimball Germane, Jay McCarthy, Michael D. Adams, Matthew Might

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

2018

Abstract allocation as a unified approach to polyvariance in control-flow analyses.

Thomas Gilray, Michael D. Adams, Matthew Might

J. Funct. Program., 2018

2017

Restricting grammars with tree automata.

Michael D. Adams, Matthew Might

Proc. ACM Program. Lang., 2017

2016

Specifying and executing optimizations for generalized control flow graphs.

William Mansky, Elsa L. Gunter, Dennis Griffith, Michael D. Adams

Sci. Comput. Program., 2016

Pushdown control-flow analysis for free.

Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

On the complexity and performance of parsing with derivatives.

Michael D. Adams, Celeste Hollenbeck, Matthew Might

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.

Thomas Gilray, Michael D. Adams, Matthew Might

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015

Optimizing SYB traversals is easy!

Michael D. Adams, Andrew Farmer, José Pedro Magalhães

Sci. Comput. Program., 2015

Towards the Essence of Hygiene.

Michael D. Adams

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

2014

Optimizing SYB is easy!

Michael D. Adams, Andrew Farmer, José Pedro Magalhães

Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

Indentation-sensitive parsing for Parsec.

Michael D. Adams, Ömer S. Agacan

Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

2013

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

Michael D. Adams, Seth D. Hitefield, Bruce Hoy, Michael C. Fowler, T. Charles Clancy

CoRR, 2013

Principled parsing for indentation-sensitive languages: revisiting landin's offside rule.

Michael D. Adams

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

2012

A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections.

Jan Midtgaard, Michael D. Adams, Matthew Might

Proceedings of the Static Analysis - 19th International Symposium, 2012

Template your boilerplate: using template haskell for efficient generic programming.

Michael D. Adams, Thomas DuBuisson

Proceedings of the 5th ACM SIGPLAN Symposium on Haskell, 2012

2011

Flow-sensitive type recovery in linear-log time.

Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig

Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2010

PPP over Ethernet (PPPoE) Extensions for Credit Flow and Link Metrics.

Bo Berry, Stan Ratliff, Ed Paradise, Tim Kaiser, Michael D. Adams

RFC, February, 2010

Scrap your zippers: a generic zipper for heterogeneous types.

Michael D. Adams

Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2010

2008

Efficient nondestructive equality checking for trees and graphs.

Michael D. Adams, R. Kent Dybvig

Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007

Representation-transparent matrix algorithms with scalable performance.

Peter Gottschling, David S. Wise, Michael D. Adams

Proceedings of the 21th Annual International Conference on Supercomputing, 2007

2006

Fast additions on masked integers.

Michael D. Adams, David S. Wise

ACM SIGPLAN Notices, 2006

Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms.

Michael D. Adams, David S. Wise

Proceedings of the 2006 workshop on Memory System Performance and Correctness, 2006