Pages that link to "Item:Q3682463"
From MaRDI portal
The following pages link to Gödel numberings, principal morphisms, combinatory algebras. A category-theoretic characterization of functional completeness (Q3682463):
Displaying 11 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Introduction to Turing categories (Q998306) (← links)
- Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus (Q1075312) (← links)
- Functional programming with combinators (Q1098628) (← links)
- Formalizing abstract computability: Turing categories in Coq (Q2333325) (← links)
- A category theoretic formulation for Engeler-style models of the untyped \(\lambda\)-calculus (Q2863881) (← links)
- From numbered sets to type theories (Q3478383) (← links)
- Cartesian closed categories of enumerations for effective type structures (Q3677755) (← links)
- A survey of categorical computation: Fixed points, partiality, combinators, \dots control? (Q3971261) (← links)
- (Q5809945) (← links)