Partial combinatory algebra: Difference between revisions

Content deleted Content added
m This has grown past the stub stage somewhat
m Simplify sentence
Line 1:
In [[theoretical computer science]] and [[mathematical logic]], a '''partial combinatory algebra''' (pca) is an algebraic structure which can be viewed as an abstraction ofabstracts a [[model of computation]]. The definition of pcas uses an idea from [[combinatory logic]]. Pcas are used to define [[realizability topos]]es.
 
==Definition==