Joe+Leslie-Hurd

a British computer scientist, Ph.D. in CS from [|University of Cambridge] in 2003 on [|formal verification] of [|probabilistic algorithms], and component design engineer at Intel Corporation, [|Portland, Oregon]. As a chess player, he enjoys solving chess problems, studies, and retrograde analysis, and formalized chess in [|Higher Order Logic (HOL)] to construct formally verified endgame databases. Joe Leslie-Hurd is further author of the open source Go playing program //Gomi//, written in [|Standard ML], and the chess diagram maker //fen2img//, which reads FEN to output diagrams in [|portable pixmap format (PPM)] image format, also written in SML. || toc =Selected Publications=
 * Home * People * Joe Leslie-Hurd**
 * [[image:joehurd.jpg link="http://www.gilith.com/"]] ||~ || **Joe Leslie-Hurd**,
 * Joe Leslie-Hurd ||~ ||^ ||
 * Joe Hurd (**2005**). //Formal Verification of Chess Endgame Databases//. in Joe Hurd, Edward Smith, [|Ashish Darbari] //Theorem proving in higher order logics: Emerging trends proceedings//. Technical Report PRG-RR-05-02, [|Oxford University] Computing Laboratory, [|pdf]
 * Joe Hurd, Guy McCrossan Haworth (**2010**). //[|Data Assurance in Opaque Computations]//. Advances in Computer Games 12, [|pdf]
 * [|Ramana Kumar], Joe Hurd (**2012**). //Standalone Tactics Using OpenTheory//. [|ITP 2012], [|pdf]
 * Joe Leslie-Hurd (**2013**). //Formally Verifed Endgame Tables//. Guest Lecture, Combinatorial Games, [|Portland State University], [|slides as pdf]
 * Joe Leslie-Hurd, Guy McCrossan Haworth (**2013**). //Computer Theorem Proving and HoTT//. ICGA Journal, Vol. 36, No. 2

=External Links=
 * [|Gilith - Welcome]
 * [|Gilith - Joe Leslie-Hurd]
 * [|Gilith - Chess]
 * [|Gilith - Chess Coaching]
 * [|Gilith - Chess Endgames]
 * [|Gilith - Go]

=References= =What links here?= include page="Joe Leslie-Hurd" component="backlinks" limit="30"
 * Up one level**