Revision as of 18:00, 25 February 2025 edit Jean Abou Samra (talk \| contribs) 354 edits m Improve intro ← Previous edit		Revision as of 18:03, 25 February 2025 edit undo Jean Abou Samra (talk \| contribs) 354 edits m Rework intro again Next edit →
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~~In particular, the [[realizability topos]] over a pca is a model of higher-order [[intuitionistic logic]] where informally every function is a program in the pca's model of computation. ==Definition==

Partial combinatory algebra: Difference between revisions