@techreport(Bhaskar:Simonsen:2020, author = {Siddharth Bhaskar and Jakob G. Simonsen}, year = {2020}, title = {Implicit Complexity via Controlled Construction and Destruction}, type = {Technical Report}, institution = {Department of Computer Science, University of Copenhagen}, ) @inproceedings(DBLP:conf/amast/Bonfante06, author = {Guillaume Bonfante}, year = {2006}, title = {Some Programming Languages for Logspace and Ptime}, editor = {Michael Johnson and Varmo Vene}, booktitle = {Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4019}, publisher = {Springer}, pages = {66--80}, doi = {10.1007/11784180\_8}, ) @article(Cook:71:CharacterizationOfPushdown, author = {Stephen A. Cook}, year = {1971}, title = {Characterizations of Pushdown Machines in Terms of Time-Bounded Computers}, journal = {J. {ACM}}, volume = {18}, number = {1}, pages = {4--18}, doi = {10.1145/321623.321625}, ) @book(DBLP:books/sp/Greibach75, author = {Sheila A. Greibach}, year = {1975}, title = {Theory of Program Structures: Schemes, Semantics, Verification}, series = {Lecture Notes in Computer Science}, volume = {36}, publisher = {Springer}, doi = {10.1007/BFb0023017}, ) @article(Immerman, author = {Neil Immerman}, year = {1988}, title = {Nondeterministic Space is Closed Under Complementation}, journal = {{SIAM} J. Comput.}, volume = {17}, number = {5}, pages = {935--938}, doi = {10.1137/0217058}, ) @book(Jones:97:ComputabilityComplexity, author = {Neil D. Jones}, year = {1997}, title = {Computability and complexity - from a programming perspective}, series = {Foundations of computing series}, publisher = {{MIT} Press}, doi = {10.7551/mitpress/2003.001.0001}, ) @article(logspace, author = {Neil D. Jones}, year = {1999}, title = {{LOGSPACE} and {PTIME} Characterized by Programming Languages}, journal = {Theor. Comput. Sci.}, volume = {228}, number = {1-2}, pages = {151--174}, doi = {10.1016/S0304-3975(98)00357-0}, ) @article(jfp, author = {Neil D. Jones}, year = {2001}, title = {The expressive power of higher-order types or, life without {CONS}}, journal = {J. Funct. Program.}, volume = {11}, number = {1}, pages = {55--94}, doi = {10.1017/S0956796800003889}, url = {http://journals.cambridge.org/action/displayAbstract?aid=68581}, ) @book(Knuth:73:ArtOfProgramming, author = {Donald E. Knuth}, year = {1973}, title = {The Art of Computer Programming, Volume {III:} Sorting and Searching}, publisher = {Addison-Wesley}, ) @inproceedings(DBLP:conf/esop/KopS17, author = {Cynthia Kop and Jakob Grue Simonsen}, year = {2017}, title = {The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming}, editor = {Hongseok Yang}, booktitle = {Programming Languages and Systems - 26th European Symposium on Programming, {ESOP} 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10201}, publisher = {Springer}, pages = {668--695}, doi = {10.1007/978-3-662-54434-1\_25}, ) @article(Kuroda, author = {Sige-Yuki Kuroda}, year = {1964}, title = {Classes of languages and linear-bounded automata}, journal = {Information and Control}, volume = {7}, number = {2}, pages = {207--223}, doi = {10.1016/S0019-9958(64)90120-2}, ) @article(mccarthy, author = {John McCarthy}, year = {1960}, title = {Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part {I}}, journal = {Commun. {ACM}}, volume = {3}, number = {4}, pages = {184--195}, doi = {10.1145/367177.367199}, ) @book(moschovakis, author = {Yiannis Moschovakis}, year = {2019}, title = {Abstract Recursion and Intrinsic Complexity}, publisher = {Cambridge University Press (Lecture Notes in Logic)}, doi = {10.1017/9781108234238}, ) @book(papadimitriou, author = {Christos H. Papadimitriou}, year = {1994}, title = {Computational complexity}, publisher = {Addison-Wesley}, ) @article(DBLP:journals/jcss/Savitch70, author = {Walter J. Savitch}, year = {1970}, title = {Relationships Between Nondeterministic and Deterministic Tape Complexities}, journal = {J. Comput. Syst. Sci.}, volume = {4}, number = {2}, pages = {177--192}, doi = {10.1016/S0022-0000(70)80006-X}, ) @article(Szelepcsenyi, author = {R{\'{o}}bert Szelepcs{\'{e}}nyi}, year = {1988}, title = {The Method of Forced Enumeration for Nondeterministic Automata}, journal = {Acta Inf.}, volume = {26}, number = {3}, pages = {279--284}, doi = {10.1007/BF00299636}, ) @article(turing, author = {Alan M. Turing}, year = {1936-7}, title = {On Computable Numbers with an Application to the {E}ntscheidungsproblem}, journal = {Proceedings of the London Mathematical Society}, volume = {42}, number = {2}, pages = {230--265}, doi = {10.1112/plms/s2-42.1.230}, )