Search

• < Previous
• 1
• Next >

Typing weak MSOL properties

We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSOL) is well suited to express properties of such trees. We&nbsp;[&hellip;]