Tim Gegg-Harrison

Professor & Chair
Department of Computer Science
Winona State University
Winona, Minnesota 55987

Office: 103-C Watkins Hall
Phone: (507)457-5381
Email: tgeggharrison@winona.edu

• Current Courses

  • CS 275 - Mathematical Foundations of Algorithms

• Education

  • PhD, 1993, Duke University, Computer Science
  • MS, 1982, The Ohio State University, Computer Science
  • BA, 1981, University of Missouri, Mathematics and Computer Science

• Research Interests

  • Formal Methods
  • Logic Programming
  • Computer Science Education

• Research Grants

  • Integrating Discrete Mathematics via CS-Complete Examples in a Model CC2001 Curriculum. NSF Grant No. DUE-0127483/0353132, January 2002 - December 2004.

• Selected Publications

  • T.S. Gegg-Harrison. Constructing Contracts: Making Discrete Mathematics Relevant to Beginning Programmers. Journal of Educational Resources in Computing, 5(2): 1-28, 2006.
  • T.S. Gegg-Harrison, G.R. Bunce, R.D. Ganetzky, C.M. Olson, and J.D. Wilson. Studying Program Correctness By Constructing Contracts. In R. Boyle and G. Evangelidis, editors, Proceedings of the 8th Annual Conference on Innovation and Technology in Computer Science Education, Thessaloniki, Greece, pages 129-133, July 2003 (ACM SIGCSE Bulletin, 35(3): 129-133, 2003).
  • T.S. Gegg-Harrison. Ancient Egyptian Numbers: A CS-Complete Example. In J. Gersting and R. McCauley, editors, Proceedings of the 32nd Technical Symposium on Computer Science Education, Charlotte, North Carolina, pages 268-272, February 2001 (ACM SIGCSE Bulletin, 33(1): 268-272, 2001).
  • T.S. Gegg-Harrison. Exploiting Program Schemata to Teach Recursive Programming. In P. Brna, B. duBoulay, and H. Pain, editors, Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study, pages 347-379, Ablex, 1999.
  • T.S. Gegg-Harrison. Extensible Logic Program Schemata. In J. Gallagher, editor, Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation, Stockholm, Sweden, pages 256-274, Springer-Verlag (Lecture Notes in Computer Science 1207), August 1996.
  • T.S. Gegg-Harrison. Representing Logic Program Schemata in Lambda-Prolog. In L.S. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, Kanagawa, Japan, pages 467-481, MIT Press, June 1995.
  • T.S. Gegg-Harrison. Exploiting Program Schemata in an Automated Program Debugger. Journal of Artificial Intelligence in Education, 5: 255-278, 1994.
  • T.S. Gegg-Harrison. Adapting Instruction to the Student's Capabilities. Journal of Artificial Intelligence in Education, 3: 169-181, 1992.
  • T.S. Gegg-Harrison. Learning Prolog in a Schema-Based Environment. Instructional Science, 20: 173-192, 1991.