Realizability models for a linear dependent PCF

DOI10.1016/J.TCS.2015.03.005zbMATH Open1327.68109OpenAlexW2087185103MaRDI QIDQ2346992FDOQ2346992

Authors Aloïs Brunel, Marco Gaboardi

Publication date 26 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.03.005

zbMATH Keywords

implicit computational complexityrealizability model

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Functional programming and lambda calculus (68N18)

Recommendations

• Linear Realizability
• scientific article; zbMATH DE number 65803
• Realizability interpretation of PA by iterated limiting PCA
• Realizability models and implicit complexity
• Realisation and estimation of piecewise-linear output-error models
• A realization theory for perturbed linear systems
• scientific article; zbMATH DE number 3912240
• Possibilistic linear systems and their application to the linear regression model
• On the Realization of 2-D Linear Systems With Recursively Computable Latent Variable Models
• Region configurations for realizability of lattice piecewise-linear models.

Cites work

• scientific article; zbMATH DE number 1696756 (Why is no real title available?)
• scientific article; zbMATH DE number 5851813 (Why is no real title available?)
• scientific article; zbMATH DE number 512786 (Why is no real title available?)
• scientific article; zbMATH DE number 2182486 (Why is no real title available?)
• A new recursion-theoretic characterization of the polytime functions
• Biorthogonality, step-indexing and compiler correctness
• Bounded Linear Logic, Revisited
• Bounded linear logic: A modular approach to polynomial-time computability
• Computational ludics
• Dependent ML An approach to practical programming with dependent types
• Extending type theory with forcing
• Linear dependent types and relative completeness
• Locus solum: From the rules of logic to the logic of rules.
• Parametric polymorphism and operational equivalence
• Quantitative classical realizability
• Realisability semantics of parametric polymorphism, general references and recursive types
• Realizability algebras: a program to well order \(\mathbb R\)
• Realizability models and implicit complexity
• Realizability models for BLL-like languages
• Resource control graphs

Cited in

(3)

• Linear dependent types in a call-by-value scenario
• Linear dependent types and relative completeness
• Region configurations for realizability of lattice piecewise-linear models.

This page was built for publication: Realizability models for a linear dependent PCF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346992)