On light logics, uniform encodings and polynomial time
From MaRDI portal
Publication:5482265
Recommendations
Cited in
(13)- Theoretical Computer Science
- Light logics and optimal reduction: completeness and complexity
- A Semantic Proof of Polytime Soundness of Light Affine Logic
- The role of polymorphism in the characterisation of complexity by soft types
- scientific article; zbMATH DE number 2061714 (Why is no real title available?)
- Implicit computation complexity in higher-order programming languages
- Polynomial time in untyped elementary linear logic
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- scientific article; zbMATH DE number 1424054 (Why is no real title available?)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- A semantic proof of polytime soundness of light affine logic
- Light affine set theory: A naive set theory of polynomial time
This page was built for publication: On light logics, uniform encodings and polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482265)