Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Reasoning about lists
Description
This lecture covers the laws of concatenation on lists, including associativity and the neutral element. It explains proof by natural induction, with an example of proving a factorial function. The concept of referential transparency in pure functional programs is discussed, along with structural induction on lists. An example demonstrates the application of structural induction to prove properties of list concatenation.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.