Adventures in time and space

DOI10.1145/1111037.1111053MaRDI QIDQ5348922zbMATH OpenOpenAlexFDO

Authors Norman Danner, James S. Royer

Publication date 21 August 2017

Published in Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1111037.1111053

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)

Recommendations

• Adventures in time and space
• Two algorithms in search of a type-system
• Time-Complexity Semantics for Feasible Affine Recursions
• Higher type recursion, ramification and polynomial time
• scientific article; zbMATH DE number 1848310

Cited in

(5)

• scientific article; zbMATH DE number 5665826 (Why is no real title available?)
• Game semantics approach to higher-order complexity
• On basic feasible functionals and the interpretation method
• A tier-based typed programming language characterizing feasible functionals
• Adventures in time and space

This page was built for publication: Adventures in time and space

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