Andrew Adams-Moran

Andrew Adams-Moran

Contact

Research and Engineering
Office: 503.626.6616 x113
Cell: 503.914.7480
Email: adams-moran (at) galois (dot) com
LinkedIn: http://www.linkedin.com/in/andyam

At Galois

I'm a matchmaker: I match clients (and their needs) with Galois people and capabilities. This requires an understanding of the technical issues, of what is possible, how a client's problem fits into our market strategy, but above all, listening. Another way to think of this is that I work hard to build trust. Our clients have truly profound problems they are required to solve, and they take stewardship of their constituents' funds (whether taxpayers or shareholders) very seriously. A deep level of trust in Galois' understanding of what's important to them, in our ability to perform, and in our sincerity, is the basis of all of our working relationships.

My Background

I started out as a researcher in theoretical computer science, specifically semantics of non-determinism in functional languages. I found working in an esoteric field to be unsatisfying, in that my work was of interest to a handful of people around the world. The chance to apply my ideas and those of the functional programming community to solve real problems was too good to pass up. I spent a few very fun years working as a developer and project lead, and then started helping set up projects for the upcoming work year. Now, I work on setting up research, technology maturation, and technology transition projects (with a focus on the first two). I'm getting to spend more and more of my time writing Haskell code these days, which is profoundly satisfying!

Publications 

  • Moran, A., Sands, D., and Carlsson, M. 2003. Erratic fudgets: a semantic theory for an embedded coordination language. Sci. Comput. Program. 46, 1-2 (Jan. 2003), 99-135. 
  • Sands, D., Gustavsson, J., and Moran, A. 2002. Lambda calculi and linear speedups. In the Essence of Computation: Complexity, Analysis, Transformation, T. Æ. Mogensen, D. A. Schmidt, and I. H. Sudborough, Eds. Springer-Verlag New York, New York, NY, 60-82.
  • Moran, A., Teisher, J., Gill, A., Pasalic, E., and Veneruso, J. 2001. Automated translation of legacy code for ATE. In Proceedings of the IEEE international Test Conference 2001 (October 30 - November 01, 2001). IEEE Computer Society, Washington, DC, 148-156.
  • Marlow, S., Jones, S. P., Moran, A., and Reppy, J. 2001. Asynchronous exceptions in Haskell. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (Snowbird, Utah, United States). PLDI '01. ACM, New York, NY, 274-285. 
  • Lassen, S. B. and Moran, A. 1999. Unique Fixed Point Induction for McCarthy's Amb. In Proceedings of the 24th international Symposium on Mathematical Foundations of Computer Science (September 06 - 10, 1999). M. Kutylowski, L. Pacholski, and T. Wierzbicki, Eds. Springer-Verlag, London, 198-208.
  • Moran, A., Sands, D., and Carlsson, M. 1999. Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language. In Proceedings of the Third international Conference on Coordination Languages and Models (April 26 - 28, 1999). P. Ciancarini and A. L. Wolf, Eds. Springer-Verlag, London, 85-102.
  • Moran, A. and Sands, D. 1999. Improvement in a lazy context: an operational theory for call-by-need. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Antonio, Texas, United States, January 20 - 22, 1999). POPL '99. ACM, New York, NY, 43-56.
  • Hughes, J. and Moran, A. 1995. Making choices lazily. In Proceedings of the Seventh international Conference on Functional Programming Languages and Computer Architecture (La Jolla, California, United States, June 26 - 28, 1995). FPCA '95. ACM, New York, NY, 108-119.
  • Pritchard, P. A., Moran, A., and Thyssen, A. 1995. Twenty-two primes in arithmetic progression. Math. Comput. 64, 211 (Jul. 1995), 1337-1339.
  • Bailes, P. A., Gong, M., and Moran, A. 1993. Why Functional Languages Really Need Parallelism. In Proceedings of the Fifth international Conference on Computing and information (May 27 - 29, 1993). O. Abou-Rabia, C. K. Chang, and W. W. Koczkodaj, Eds. IEEE Computer Society, Washington, DC, 423-427.
  • Hughes, J. and Moran, A. 1993. A Semantics for Locally Bottom-Avoiding Choice. In Proceedings of the 1992 Glasgow Workshop on Functional Programming (July 06 - 08, 1992). J. Launchbury and P. M. Sansom, Eds. Springer-Verlag, London, 102-112.