https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/ Recent content in IMPL 2026 Summer on Software Technology Hugo en https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pc1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pc1/ Many people want to have their files available on multiple devices and want seamless file synchronization across them. For various reasons, they might not want to rely on centralized cloud services and want to have their files available while offline. This introduces distributed systems challenges like concurrent edits. In this project, you will build a decentralized, peer-to-peer file synchronization tool similar to Syncthing. To guarantee that all devices eventually agree on the same version of the files, you will rely on techniques used by Conflict-free Replicated Data Types (CRDTs). https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pd1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pd1/ Lean is a modern, functional, dependently-typed programming language that allows both to write efficient code (with a foreign function interface to C), but at the same time can serve as a proof assistant, via the proofs-are-programs principle. We can start with the functional programming, start with a toy arithmetic expression DSL and an interpreter. We could grow the language. We could learn to use of monads and monad transformers to represents effects, look into the difference between first-order and higher-order representations of syntax and their benefits and drawbacks, try out well-typed and well-scoped syntax. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf1/ The premise of Local-first software is that data is stored on the device, but can be synchronized between devices in any way, from cloud sync to “sneaker net”. In practice, most sync solutions default to internet-based connectivity, either cloud-based or peer-to-peer. While this works, local-first solutions should be more ambitions: The idea of this topic is to build a proof-of-concept for a peer discovery and sync framework that actively makes use of local connectivity - be that LAN, WiFi Direct, Bluetooth (Low Energy), UWB, or something else. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf2/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf2/ Local-first software emphasizes user agency and privacy as a core principle, while still supporting features we expect from modern apps, like great performance and real-time collaboration. In local-first apps, the “cloud” is entirely optional, which means that your data only belongs to you, and no-one can restrict your access to that data. We are researching how to make local-first apps better, and what it actually takes to go from traditional cloud-based applications to local-first ones. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf3/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pf3/ Git is a popular tool for collaborating on source code asynchronously, but it requires significant external tooling for more intensive collaboration (e.g. GitHub). But even with that tooling, keeping track of what different collaborators are doing across multiple repositories is challenging and requires active effort. The idea of this topic is to add tooling around Git that can reveal what collaborators are doing across the code base(s), without requiring manual effort and while preserving privacy as best as possible. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pj1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pj1/ Protocol replicated data types (PRDTs) are a novel approach for implementing distributed protocols using replicated data types (RDTs). The core idea is to use RDTs as a way to track protocol knowledge that is replicated between the different peers. Whenever a peer makes progress on the protocol, they add new facts to this knowledge store which will eventually reach other peers. The replicated knowledge grows monotonically and once discovered facts are never removed again. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/ps1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/ps1/ Actor programming is a concurrency model where independent entities called “actors” communicate by passing messages and are found in languages such as Erlang and Elixir. Multiparty session types specify communication protocols among multiple participants, ensuring that all follow a shared protocol and ruling out errors like deadlocks or message mismatches at compile time. Maty is the first actor language design supporting both static multiparty session typing and the full power of actors taking part in multiple sessions. https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pt1/ Mon, 01 Jan 0001 00:00:00 +0000 https://www.st.informatik.tu-darmstadt.de/teaching/impl/26summer/pt1/ Lean is a modern, functional, dependently-typed programming language that allows both to write efficient code (with a foreign function interface to C), but at the same time can serve as a proof assistant, via the proofs-are-programs principle. In this project, you will implement the semantics (e.g. interpreter or operational semantics) and type systems of very simple languages and prove properties about them. For this, you will use Lean, which is both a programming language and a theorem prover.