Staff

Lecture: Prof. Dr. Ralf Lämmel

Lab: Marcel Heinz

Exam

• Final: 20.02.2015, 12:45-14:00 K101
• Resit: ??.??.15 (probably in late April in SS15)
• Student ids will be checked.
• You need to have a valid admission for the exam; see rules below.
• You *must* register with KLIPS:
  • "Programmierparadigmen" for "old" exam rules
  • "Theorie der Programmiersprachen" for current exam rules

Links

• Timeless course portal (Wiki)
• KLIPS: lecture; lab
• Curriculum: Module 04IN1024
• Open-source repository with some material
• Public web area with material
• Supporting resources
• Past exams: *.pdf (requires uniko login)
• Twitter: @yaplcourse and @reallynotabba
• Facebook: Private group for course

Lectures

Lectures start "st".

Code from the lectures may be released here:

https://github.com/rlaemmel/pltcourse/tree/master/src/lecture-logs/unikold1415

Slides (if any) from the lectures may be released here:

http://softlang.uni-koblenz.de/pltcourse/slides

Lists of topics and resources:

• Introduction (.pdf)
• Prolog crash course (.pdf)
• Syntax, semantics, and type system of MiniForth (.pro)
• Syntax and semantics of SortOfWhile (.pro)
• SortOfWhile with dynamic procedures (.pro)
• SortOfWhile with static procedures (.pro)
• Various lambda calculi (.pdf)
• The simple untyped lambda calculus (.pro)
• Church numerals (.hs)
• Recursion with fixed point combinator (.hs)
• The applied untyped lambda calculus (.pro)
• Featherweight Java Paper (.pdf); [Slides (.pdf)
• Denotational semantics (.pdf); (.hs)
• The Calculus of Communicating Systems (.pdf); (.mp4)
• Axiomatic semantics (.pro); (.html)

Labs

Labs start "st".

Material and demos from the lab are available via svn: https://svn.uni-koblenz.de/softlang/main/courses/plt1415/public/labs

Assignments

Reference solutions are published via svn: https://svn.uni-koblenz.de/softlang/main/courses/plt1415/public/solutions/

#10 is a bonus assignment.

Examination rules

• Admission rules for final:
  • Assemble teams of 3-4 members, create a svn repo at uni-koblenz.de, grant access to heinz, laemmel, and softlang, and send the login names of team members and the svn repo URL to ed.znelbok-inu|znieh#ed.znelbok-inu|znieh with "plt1415" in the subject line. (Note: you must use the assignment numbers 1, 2, … as top-level directory names in your repo.)
  • Each team must submit at least 6 acceptable solutions of 9 assignments by the deadline through their svn repo. Assignments may break down into multiple options. In this case, a team's solution is considered, if at least one of the options is acceptable.
  • Each student must present one solution successfully once.
  • Exam admission is inherited from previous editions ever since 2010/11.

Rationale: The assignments are designed to help understand all material covered in the lecture. Also, the assignments help with effective preparation for the exam. Upcoming assignments are discussed briefly in the lab. Completed assignments are discussed in detail in the lab on the grounds of student presentations and a reference solution prepared by the lab assistant. All submitted solutions are briefly reviewed by the lab assistant to determine whether the solutions are "acceptable". The criteria for accepting a solution are discussed and calibrated in the lab. (Essentially, simple assignments must be solved more or less correctly and completely whereas more complex assignments may already be acceptable if there is an insightful approach to the problem that is perhaps not carried through correctly or completely.) The lab assistants calls up students to present their solution. The idea is to give strong preference to students who had not yet presented before. As there are typically multiple assignment options and different solution options as well, there could be a number of student presentations.