The geometry of types

DOI10.1145/2429069.2429090zbMath1301.68184arXiv1210.6857OpenAlexW2010790229MaRDI QIDQ2931793

Ugo Dal Lago, Barbara Petit

Publication date: 27 November 2014

Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

linear logicresource consumptionfunctional programmingcomplexity analysishigher-order types

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Tight typings and split bounds, fully developed ⋮ Linear dependent types in a call-by-value scenario ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ lambda!-calculus, Intersection Types, and Involutions ⋮ 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 types