Beta-reduction in the untyped lambda calculus now runs on spiking neurons, matching a symbolic oracle across ten validation classes
Beta-reduction in the untyped lambda calculus has until now been carried out by symbolic engines, or represented by neural components that hand the rewriting to an external interpreter. This closed-loop reducer assigns redex detection, subterm segmentation, variable-binding detection, De Bruijn index arithmetic, token copying and inter-step role maintenance to leaky integrate-and-fire neurons with membrane dynamics, synaptic currents, axonal delays and spike-timing plasticity, and agrees with a symbolic oracle across ten validation classes.