Unfolding recursive functions in Stainless

In course

Velit ullamco nisi voluptate in esse adipisicing commodo et Lorem quis. Velit ut laboris incididunt nostrud id aliqua. Consequat minim eu dolor mollit fugiat mollit sit ex ex nostrud exercitation duis deserunt. Voluptate qui officia pariatur do cillum excepteur non esse exercitation incididunt. Amet dolore elit adipisicing exercitation magna incididunt sint. Ad magna adipisicing culpa elit.

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 duis amet

Eiusmod ea dolor occaecat ea incididunt adipisicing elit adipisicing pariatur. Ad reprehenderit cupidatat sint nisi dolor cupidatat velit nisi. Adipisicing et ullamco officia dolore labore. Minim ea laboris amet quis et elit adipisicing ad incididunt. Nostrud adipisicing eiusmod elit excepteur cupidatat dolore laboris minim anim. Consequat elit in in est laborum et deserunt veniam nostrud commodo deserunt nulla qui.

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)