Pages that link to "Item:Q579245"

The following pages link to Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245):

Displaying 9 items.

• Completeness of type assignment in continuous lambda models (Q792995) (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
• Interpreting higher computations as types with totality (Q1337495) (← links)
• The computational power of \({\mathcal M}^\omega\) (Q2776817) (← links)
• Higher types, finite domains and resource-bounded Turing machines (Q2882561) (← links)
• (Q3708005) (← links)
• (Q3816069) (← links)
• Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
• (Q4793030) (← links)