The geometry of linear higher-order recursion

DOI10.1145/1462179.1462180zbMath1351.03060arXivcs/0506080OpenAlexW2133014686MaRDI QIDQ2946566

Ugo Dal Lago

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0506080

zbMATH Keywords

lambda calculustype systemsimplicit computational complexitygeometry of interactionhigher-order recursion

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Interaction graphs: graphings ⋮ A correspondence between maximal abelian sub-algebras and linear logic fragments ⋮ Towards a geometry of recursion ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: The geometry of linear higher-order recursion