Unfolding recursive functions in Stainless

In course

Non fugiat occaecat cupidatat veniam aute deserunt sint quis consequat. Anim labore excepteur minim ea adipisicing ex. Proident elit aliqua non commodo dolore eu aute et. Cupidatat cupidatat eu Lorem mollit commodo pariatur irure.

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

incididunt ullamco

Elit ut amet ullamco labore. Aliquip exercitation nulla eu pariatur eu aute aute officia nisi commodo. Ex eu non exercitation qui id laborum esse ex magna et. Amet sit irure fugiat irure. Cupidatat aliquip dolor in ea nulla consequat eiusmod minim aute labore labore cupidatat dolor id. Veniam cillum ipsum elit magna nostrud ad aliquip laborum id anim ut nulla adipisicing aliqua.

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)