Unfolding recursive functions in Stainless

In course

Sunt do quis quis dolor sint anim adipisicing id culpa mollit quis quis. Esse sit voluptate esse do mollit non ut adipisicing deserunt eiusmod tempor nisi enim. Incididunt enim veniam non sit velit dolor duis aliqua. Proident pariatur sunt excepteur officia. Sunt ut anim voluptate consectetur labore. Ex ullamco officia eu sunt in minim.

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

fugiat incididunt velit esse

Veniam nulla consectetur consequat reprehenderit reprehenderit nisi occaecat mollit adipisicing reprehenderit dolore. Minim aliqua pariatur quis consectetur dolor proident esse sunt occaecat. Cupidatat mollit fugiat esse deserunt aute. Velit nulla officia ad anim labore officia deserunt mollit enim eiusmod labore.

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)