Assistant Professor, School of Computing
Ph.D., TU Munich, 1999
Professor Slind joined the faculty in 2001. His
research interests are in logic and functional programming. He is
particularly interested in higher order logic, its implementation, and
its application to deductive verification of system properties. Recent
research has investigated the modeling of generic and functional
programming. Before coming to Utah, he participated in a European
project that developed middleware for applications that require a
theorem proving component.
- Konrad Slind. Another Look at Nested Recursion. In
Proceedings of TPHOLs 2000, Springer-Verlag Lecture Notes
in Computer Science, No. 1869.
- Richard Boulton and Konrad Slind. Automatic Derivation and
Application of Induction Schemes for Mutually Recursive Functions. In
Proceedings of CL 2000, Springer-Verlag Lecture Notes in
Artificial Intelligence, No. 1861.
- Konrad Slind, Wellfounded Schematic Definitions. In
Proceedings of CADE-17, Springer-Verlag Lecture Notes in
Computer Science, No. 1831.
- Louise Dennis, Graham Collins, Michael Norrish, Richard Boulton,
Konrad Slind, Graham Robinson, Mike Gordon, and Tom Melham. The
PROSPER Toolkit. In Proceedings of TACAS 2000.
Springer-Verlag Lecture Notes in Computer Science, No. 1785.
Awarded a best paper prize.
- Konrad Slind and Richard Boulton. Iterative Dialogues and
Automated Proof. In Frontiers of Combining Systems 2, No. 7,
D. Gabbay and M. de Rijke (eds). In Studies in Logic and
Computation, Research Studies Press, 2000.