Partial combinatory algebra: Difference between revisions

Revision as of 17:57, 25 February 2025

Revision as of 18:00, 25 February 2025

Line 1:

In [[theoretical computer science]] and [[mathematical logic]], 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]]. PcasThe are[[realizability usedtopos]] toover definea pca is a model of higher-order [[realizabilityintuitionistic toposlogic]]es where informally every function is a program in the pca's model of computation.

==Definition==