Linear Dependent Types and Relative Completeness

DOI10.2168/LMCS-8(4:11)2012zbMath1261.03073OpenAlexW2095867533MaRDI QIDQ4899111

Marco Gaboardi, Ugo Dal Lago

Publication date: 7 January 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-8(4:11)2012

zbMATH Keywords

linear logicresource consumptionrelative completenessdependent typesimplicit computational complexity

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (20)

Higher-order interpretations and program complexity ⋮ Non-linearity as the Metric Completion of Linearity ⋮ On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets ⋮ Unnamed Item ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ Linear dependent types in a call-by-value scenario ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Generalized bounded linear logic and its categorical semantics ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Graded modal dependent type theory ⋮ Unnamed Item ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ Unnamed Item ⋮ Towards a Formal Theory of Graded Monads ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs ⋮ Realizability models for a linear dependent PCF ⋮ Relational cost analysis in a functional-imperative setting ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: Linear Dependent Types and Relative Completeness