Travelled to:1 × Canada
1 × France
1 × India
1 × Italy
2 × USA
Collaborated with:∅ M.Might R.K.Dybvig J.Midtgaard A.Farmer J.P.Magalhães A.W.Keep A.Chauhan
Talks about:sensit (2) tree (2) nondestruct (1) techniqu (1) structur (1) restrict (1) recoveri (1) principl (1) automata (1) revisit (1)
Person: Michael D. Adams
DBLP: Adams:Michael_D=
Contributed to:
2015
20142013
2012
2011
20082017Wrote 7 papers:
- POPL-2015-Adams #towards
- Towards the Essence of Hygiene (MDA), pp. 457–469.
- PEPM-2014-AdamsFM #exclamation #optimisation #scrap your boilerplate
- Optimizing SYB is easy! (MDA, AF, JPM), pp. 71–82.
- POPL-2013-Adams #parsing
- Principled parsing for indentation-sensitive languages: revisiting landin’s offside rule (MDA), pp. 511–522.
- SAS-2012-Midtgaard0M #proving
- A Structural Soundness Proof for Shivers’s Escape Technique — A Case for Galois Connections (JM, MDA, MM), pp. 352–369.
- OOPSLA-2011-AdamsKMMCD #polynomial
- Flow-sensitive type recovery in linear-log time (MDA, AWK, JM, MM, AC, RKD), pp. 483–498.
- ICFP-2008-AdamsD #graph #performance #similarity
- Efficient nondestructive equality checking for trees and graphs (MDA, RKD), pp. 179–188.
- OOPSLA-2017-AdamsM #automaton #strict
- Restricting grammars with tree automata (MDA, MM), p. 25.