default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Adams 0001
Person information
- affiliation: University of Michigan, USA
- affiliation: University of Utah, Salt Lake City, UT, USA
- affiliation (2013 - 2014): University of Illinois at Urbana-Champaign, IL, USA
- affiliation (2011 - 2013): Portland State University, OR, USA
- affiliation (PhD 2011): Indiana University, Bloomington, IN, USA
Other persons with the same name
- Michael D. Adams 0002
![[0000-0001-6163-7062]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6163-7062")
— University of Victoria, Department of Electrical and Computer Engineering, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[e1]Baptiste Saleil, Michael D. Adams:
Proceedings of the 2020 Scheme and Functional Programming Workshop, Online, Virtual Event, August 20-28, 2020. CSE Technical Reports CSE-TR-001-21, University of Michigan 2021 [contents]- [i5]Baptiste Saleil, Michael D. Adams:
Proceedings of the 2020 Scheme and Functional Programming Workshop. CoRR abs/2101.06759 (2021) - 2020
- [j6]Pierce Darragh, Michael D. Adams:
Parsing with zippers (functional pearl). Proc. ACM Program. Lang. 4(ICFP): 108:1-108:28 (2020) - [c16]Kimball Germane, Michael D. Adams:
Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap. ESOP 2020: 197-223
2010 – 2019
- 2019
- [c15]Kimball Germane, Jay McCarthy, Michael D. Adams, Matthew Might:
Demand Control-Flow Analysis. VMCAI 2019: 226-246 - 2018
- [j5]Thomas Gilray, Michael D. Adams, Matthew Might:
Abstract allocation as a unified approach to polyvariance in control-flow analyses. J. Funct. Program. 28: e18 (2018) - 2017
- [j4]Michael D. Adams, Matthew Might:
Restricting grammars with tree automata. Proc. ACM Program. Lang. 1(OOPSLA): 82:1-82:25 (2017) - 2016
- [j3]William Mansky, Elsa L. Gunter, Dennis Griffith, Michael D. Adams:
Specifying and executing optimizations for generalized control flow graphs. Sci. Comput. Program. 130: 2-23 (2016) - [c14]Thomas Gilray, Michael D. Adams, Matthew Might:
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis. ICFP 2016: 407-420 - [c13]Michael D. Adams, Celeste Hollenbeck, Matthew Might:
On the complexity and performance of parsing with derivatives. PLDI 2016: 224-236 - [c12]Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn:
Pushdown control-flow analysis for free. POPL 2016: 691-704 - [i4]Michael D. Adams, Celeste Hollenbeck, Matthew Might:
On the Complexity and Performance of Parsing with Derivatives. CoRR abs/1604.04695 (2016) - 2015
- [j2]Michael D. Adams, Andrew Farmer, José Pedro Magalhães:
Optimizing SYB traversals is easy! Sci. Comput. Program. 112: 170-193 (2015) - [c11]Michael D. Adams:
Towards the Essence of Hygiene. POPL 2015: 457-469 - [i3]Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn:
Pushdown Control-Flow Analysis for Free. CoRR abs/1507.03137 (2015) - 2014
- [c10]Michael D. Adams, Ömer S. Agacan:
Indentation-sensitive parsing for Parsec. Haskell 2014: 121-132 - [c9]Michael D. Adams, Andrew Farmer, José Pedro Magalhães:
Optimizing SYB is easy! PEPM 2014: 71-82 - 2013
- [c8]Michael D. Adams:
Principled parsing for indentation-sensitive languages: revisiting landin's offside rule. POPL 2013: 511-522 - [i2]Michael D. Adams, Seth D. Hitefield, Bruce Hoy, Michael C. Fowler, T. Charles Clancy:
Application of Cybernetics and Control Theory for a New Paradigm in Cybersecurity. CoRR abs/1311.0257 (2013) - 2012
- [c7]Michael D. Adams, Thomas DuBuisson:
Template your boilerplate: using template haskell for efficient generic programming. Haskell 2012: 13-24 - [c6]Jan Midtgaard, Michael D. Adams, Matthew Might:
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. SAS 2012: 352-369 - 2011
- [c5]Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig:
Flow-sensitive type recovery in linear-log time. OOPSLA 2011: 483-498 - 2010
- [c4]Michael D. Adams:
Scrap your zippers: a generic zipper for heterogeneous types. ICFP-WGP 2010: 13-24 - [i1]Bo Berry, Stan Ratliff, Ed Paradise, Tim Kaiser, Michael D. Adams:
PPP over Ethernet (PPPoE) Extensions for Credit Flow and Link Metrics. RFC 5578: 1-24 (2010)
2000 – 2009
- 2008
- [c3]Michael D. Adams, R. Kent Dybvig:
Efficient nondestructive equality checking for trees and graphs. ICFP 2008: 179-188 - 2007
- [c2]Peter Gottschling, David S. Wise, Michael D. Adams:
Representation-transparent matrix algorithms with scalable performance. ICS 2007: 116-125 - 2006
- [j1]Michael D. Adams, David S. Wise:
Fast additions on masked integers. ACM SIGPLAN Notices 41(5): 39-45 (2006) - [c1]Michael D. Adams, David S. Wise:
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. Memory System Performance and Correctness 2006: 41-50
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
