Revision as of 12:14, 2 March 2025 edit Citation bot (talk \| contribs) Bots 5,867,152 edits Added website. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:Articles with empty sections from February 2025 \| #UCB_Category 110/255 ← Previous edit		Latest revision as of 19:07, 18 March 2025 edit undo Jean Abou Samra (talk \| contribs) 354 edits m Avoid giving the idea that a topos is intensional for functions
Line 1: In [[theoretical computer science]] and [[mathematical logic]], specifically in [[realizability]], a '''partial combinatory algebra''' (pca) is an algebraic structure which abstracts a [[model of computation]]. The definition of pcas uses an idea from [[combinatory logic]]. The [[realizability topos]] over a pca is a model of higher-order [[intuitionistic logic]] where informally every function is ~~a program~~computable in the ~~pca's~~ model of computation specified by the pca. ==Definition==

Partial combinatory algebra: Difference between revisions