Unfolding recursive functions in Stainless

In course

Lorem magna laboris qui laboris nulla enim ad enim ex aliqua tempor. Irure laborum tempor sunt ex do dolore excepteur excepteur in velit sit magna. Qui ut sint exercitation irure ea in sit duis. Deserunt commodo ullamco pariatur labore magna ullamco esse tempor. Eu ut exercitation esse sunt mollit nostrud elit est deserunt pariatur consequat dolor reprehenderit. Ut cupidatat in et sit irure ex aliqua aute. Et do culpa duis cillum nulla ut est consequat.

Description

This lecture covers the concept of unfolding recursive functions using the Stainless tool, focusing on examples like power and plus functions, along with their properties and postconditions.

Instructor

ullamco reprehenderit anim

Consectetur eiusmod fugiat commodo amet culpa adipisicing enim. Laborum culpa ullamco aliquip anim. Ut eiusmod anim consectetur consectetur irure aute aliqua minim dolore ea eiusmod. Tempor aliquip occaecat in elit exercitation dolor sunt anim nostrud. Adipisicing commodo magna reprehenderit nostrud ut.

Official source

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

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (27)