Partial combinatory algebra: Difference between revisions

Revision as of 18:03, 25 February 2025

Revision as of 18:04, 25 February 2025

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]]. In particular, theThe [[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==