|DOZENT:IN:||Prof. Dr. Michael Walter|
|FAKULTÄT:||Fakultät für Informatik|
|ANGEBOTEN IM:||jedes Wintersemester|
LERNZIELEIn this seminar, you will obtain insight into a variety of modern programming languages and some of their key features and concepts. This will help you prepare for a BSc project in the theory of programming languages, but also teach you practical skills that are useful in adjacent fields such as software engineering. In addition, you get to practice some fundamental skills: independent literature search and comprehension; distilling the essence of a research topic into a report; time management; giving feedback; the scientific peer-review process.
INHALTComputing is ubiquitous in our daily life; it pervades everything from mobile phones and embedded devices to supercomputers and cloud computing infrastructure. Given these vastly different platforms and use cases, there is a wide variety of programming languages - they differ in the target domains they are designed for, the paradigms they follow and the concepts they are built on, and the features and abstractions that they offer programmers to express computations clearly and robustly. In this seminar you will have the opportunity to explore a variety of modern programming languages and their key features.
You will each study one programming language, with an emphasis on certain key features (see the list below for possible choices). You will present the results of your investigations to your peers and also provide a written report. Please think carefully about the underlying motivations, fundamental concepts, instructive examples, and possible application scenarios. Work out similarities between the language that you are presenting with languages other students have presented before you. In addition, you will be asked to peer-review two of your fellow students’ contributions. This will allow you to learn from other and get acquainted with good scientific practice.
C++ (templates, RAII, exceptions, constexpr, copy vs move)
Coq (concepts covered in the first three chapters in this book)
Go (error handling, defer, channels and goroutines, garbage collection, go generate)
Haskell (type classes, lazy evaluation, purity, IO and other monads, do notation)
Idris 2 (dependent types, multiplicities, theorem proving)
Julia (multiple dispatch, metaprogramming and macros, arrays, vectorization and broadcasting)
OCaml (type inference, algebraic data types and pattern matching, modules and functors)
Python (keyword arguments, decorators, generators, metaclasses, operator overleading)
Racket (tail recursion, pattern-based macros, continuations, contracts)
Rust (ownership and borrowing, error handling and ? operator, traits, smart pointers)
TypeScript (type inference and narrowing, generics, keyof, conditional types, mapped types, template literal types)
WebAssembly (virtual machine, instruction set, execution environment)
Zig (memory management, error handling, generics, comptime, reflection)
Please contact us in case you would like to make your own suggestion.
VORAUSSETZUNGEN CREDITSBestandene Modulabschlussprüfung