Pages that link to "Item:Q1257009"

The following pages link to A discrimination algorithm inside \(\lambda -\beta\)-calculus (Q1257009):

Displaying 9 items.

• About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus (Q752684) (← links)
• The discrimination theorem holds for combinatory weak reduction (Q755570) (← links)
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
• Parametric \(\lambda \)-theories (Q930867) (← links)
• An algebraic view of the Böhm-out technique (Q1275631) (← links)
• An analysis of Böhm's theorem (Q1314351) (← links)
• General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
• Strong storage operators and data types (Q1805408) (← links)
• Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion (Q3007664) (← links)