Skip to content
Bruno edited this page Mar 2, 2016 · 18 revisions

If you are interested in applying for a Google Summer of Code grant to work for Skeptik, please follow Google's instructions, choosing ANU's AOSSIE as your mentoring organization and writing your proposal according to ANU's template.

In your proposal, please elaborate one of Skeptik's suggested ideas or feel free to invent your own idea within Skeptik's scope. We highly encourage you to contact us while you are preparing your application, but please also keep in mind that we have a limited capacity to answer students' questions.

Candidates and their proposals will be evaluated according to the following criteria:

  1. candidate's knowledge of the basics of logic, automated deduction and proof theory.
  2. candidate's ability (to learn) to program in Scala.
  3. candidate's basic understanding of the algorithms proposed to be implemented or improved.
  4. proposal's likelihood to be successfully implemented during the timeframe of GSoC.
  5. proposal's interest for Skeptik and for the field of proof compression.

The best way to demonstrate that you are the right candidate is by doing one or more of the following:

  • fork Skeptik's repository, and make pull requests of any contributions you might have. We suggest you try to fix some of the current issues that we have especially labeled as puzzles for GSoC. Contact us before you start.
  • include in your application links to samples of code you have produced in the past (not necessarily in Scala), and explain why you think the techniques, algorithms or data structures you used in these samples are relevant for Skeptik.
  • demonstrate your knowledge of scala, logic, automated deduction, proof theory or proof compression by making contributions to relevant Wikipedia pages and telling us about them. A good starting point is this stub on proof compression. It lists several proof compression algorithms that still do not have wikipedia pages. Read the cited papers and create or improve wikipedia pages describing the algorithms relevant for your proposal.

Good luck!

Clone this wiki locally