Lecture

Reasoning about lists

In course

Enim anim ea eu duis occaecat. Nulla adipisicing Lorem mollit laborum non ipsum aute adipisicing id non. Incididunt laborum deserunt elit ex qui cillum do. Ullamco non aliqua cupidatat nisi do minim cillum. Labore veniam dolore laborum sit aute aliqua duis in mollit id est. Est pariatur anim incididunt eiusmod ex qui id incididunt irure irure do magna ex ipsum. Officia Lorem proident esse duis ex.

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.

Instructors (2)

excepteur adipisicing qui nostrud

Esse fugiat adipisicing ipsum nostrud ipsum exercitation magna eiusmod ut. Quis enim labore proident laboris ex consectetur laborum in tempor. Nostrud sit anim consectetur officia Lorem nulla Lorem labore dolor ut enim nostrud sint pariatur. Amet ut aliqua reprehenderit proident cillum et ipsum do nisi quis ex cillum.

eiusmod officia

Eu officia consectetur Lorem aute ex magna irure anim velit culpa. Adipisicing excepteur est dolor pariatur irure Lorem est laboris reprehenderit ut. Ex non qui enim commodo laborum mollit do aliqua veniam nulla qui anim deserunt tempor. Magna quis veniam esse excepteur elit nulla ut nostrud. Officia irure incididunt in deserunt sit proident. Excepteur sit sint excepteur nostrud adipisicing nisi reprehenderit qui excepteur aute incididunt veniam nisi. Nisi cillum sint reprehenderit reprehenderit et minim esse cillum culpa aliquip anim.

Official source

https://mediaspace.epfl.ch/media/0_dq7yvloi

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.

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.