Skip to content
Ceilican edited this page Feb 10, 2013 · 18 revisions

#summary instructions for GSoC applicants.

= Instructions =

If you are interested in applying for this project, follow the instructions below:

  • get an idea of the [http://code.google.com/p/proof-compression/wiki/Basics basics of logic, automated deduction and proof theory].
  • learn how to [http://code.google.com/p/proof-compression/wiki/ProgrammingInScala program in Scala].
  • read the [http://code.google.com/p/proof-compression/wiki/Papers papers and slides describing the algorithms] that have been or have to be implemented, but don't stress if you don't understand the details.

Apply according to the [http://www.google-melange.com/gsoc/document/show/gsoc_program/google/gsoc2012/faqs#student_apply GSoC instructions] and choose [http://www.google-melange.com/gsoc/org/google/gsoc2012/cse_tuwien Computer Science and Engineering at TU-Wien] as your mentoring organization. If you want your application to impress us, please consider doing one or more of the following:

  • send 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 ResK.
  • demonstrate your knowledge of scala, logic, automated deduction, proof theory or proof compression by making contributions to relevant Wikipedia pages. A good starting point is this [http://en.wikipedia.org/wiki/Proof_compression stub on proof compression].
Clone this wiki locally