The strength of non-size increasing computation
From MaRDI portal
Publication:5178911
DOI10.1145/503272.503297zbMath1323.68213OpenAlexW2013132887MaRDI QIDQ5178911
Publication date: 17 March 2015
Published in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/503272.503297
Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Descriptive complexity and finite models (68Q19)
Related Items
Space-aware ambients and processes ⋮ Computational Complexity Via Finite Types ⋮ Read/write factorizable programs ⋮ Linear types and non-size-increasing polynomial time computation. ⋮ A Refinement of the μ-measure for Stack Programs ⋮ Resource control for synchronous cooperative threads ⋮ Two algorithms in search of a type-system ⋮ An arithmetic for non-size-increasing polynomial-time computation ⋮ Two decades of automatic amortized resource analysis ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: The strength of non-size increasing computation
