Code review is a standard practice in professional software development, yet its integration into assessed coursework remains uncommon in computing higher education. This paper describes the design and implementation of fortnightly, industry-led code reviews as a core component of a mobile application development coursework, in which postgraduate students develop features for an existing application. We outline the assessment structure, the role of external senior developers as reviewers, and how feedback and marking are managed across the review cycle. Practical guidance is offered for educators looking to adopt a similar approach, covering partnerships, student preparation, and scheduling.

Students often do not fully understand the code they have written. This sometimes does not become evident until later in their education, which can mean it is harder to fix their incorrect knowledge or misunderstandings. In addition, being able to fully understand code is increasingly important in a world where students have access to generative artificial intelligence (GenAI) tools, such as GitHub Copilot.

Type-directed programming, where one uses the overall data structure and type signatures to drive programming, is a well known technique in functional programming. In a strongly typed language such as Haskell, type signatures provide valuable information and context to the function we are working with. Often the type signature alone is enough to define the body of a function or at least to understand the overall shape of the problem.

Calling conventions are essential for the operation of modular code. While they are necessary for understanding low-level computation, it is often a difficult topic for students. Writing assembly code itself is difficult without an extra set of constraints placed on top. In this paper, we detail a double act approach to not only making calling conventions accessible, but obvious and intuitive.

Compositional Game Theory is a new, recently introduced model of economic games based upon the computer science idea of compositionality. In it, complex and irregular games can be built up from smaller and simpler games, and the equilibria of these complex games can be defined recursively from the equilibria of their simpler subgames. This paper extends the model by providing a final coalgebra semantics for infinite games. In the course of this, we introduce a new operator on games to model the economic concept of subgame perfection.