Algebras and coalgebras in the light affine Lambda calculus

DOI10.1145/2784731.2784759zbMath1360.68328OpenAlexW2016092099MaRDI QIDQ2981949

Marco Gaboardi, Romain Péchoux

Publication date: 10 May 2017

Published in: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01112165/file/main.pdf

zbMATH Keywords

coalgebraalgebraimplicit computational complexitylight logics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Polynomial time over the reals with parsimony ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: Algebras and coalgebras in the light affine Lambda calculus