2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/114828This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed ring structure K we define an extension of Terui's light affine lambda-calculus typed in LAL (Light Affine Logic) with a basic type for K. We show that this calculus captures the polynomial time function class FP(K): every typed term can be evaluated in polynomial time and conversely every polynomial time BSS machine over K can be simulated in this calculus.11 pages. A preliminary version appeared as Research Report IAC CNR Roma, N.57 (11/2004), november 2004Logic in Computer Sciencetext