Manuel Blum (1967):
A Machine-Independent Theory of the Complexity of Recursive Functions.
Journal of the Association for Computing Machinery (JACM) 14(2),
pp. 322–336.
Available at http://doi.acm.org/10.1145/321386.321395.
Guillaume Bonfante & Benjamin Greenbaum (2013):
Immune Systems in Computer Virology (working notes).
Technical Report.
Université de Lorraine,
Nancy, France.
Guillaume Bonfante, Matthieu Kaczmarek & Jean-Yves Marion (2007):
A Classification of Viruses Through Recursion Theorems.
In: Computability in Europe,
Lecture Notes in Computer Science 4497.
Springer,
pp. 73–82.
Available at http://dx.doi.org/10.1007/978-3-540-73001-9_8.
John Case & Samuel E. Moelius (2012):
Program Self-Reference in Constructive Scott Subdomains.
Theory of Computing Systems 51(1),
pp. 22–49.
Available at http://dx.doi.org/10.1007/s00224-011-9372-1.
Alonzo Church & J. Barkley Rosser (1936):
Some Properties of Conversion.
Transactions of the American Mathematical Society 39,
pp. 11–21.
Available at http://dx.doi.org/10.2307/1989762.
Yoshiko Futamura (1999):
Partial evaluation of computing process – an approach to a compiler-compiler.
Higher-Order and Symbolic Computation 12(4),
pp. 381–391.
Available at http://dx.doi.org/10.1023/A:1010095604496.
Roberto Giacobazzi, Neil D. Jones & Isabella Mastroeni (2012):
Obfuscation by partial evaluation of distorted interpreters.
In: ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, PEPM 2012,
pp. 63–72.
Available at http://doi.acm.org/10.1145/2103746.2103761.
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff & Neil D. Jones (1989):
Experiments with Implementations of Two Theoretical Constructions.
In: Logic at Botik,
LNCS 363.
Springer,
pp. 119–133.
Available at http://dx.doi.org/10.1007/3-540-51237-3_11.
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen & Søren Bjerregaard Vrist (2011):
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation.
Scientific Annals of Computer Science 21(1),
pp. 73–106.
Available at http://www.infoiasi.ro/bin/Annals/Article?v=XXI1&a=9.
Neil D. Jones (1993):
Constant time factors do matter.
In: ACM Symposium on Theory of Computing, STOC 1993.
ACM,
pp. 602–611.
Available at http://doi.acm.org/10.1145/167088.167244.
Neil D. Jones (1997):
Computability and Complexity from a Programming Perspective,
1 edition,
Foundations of Computing.
MIT Press,
Boston, London.
Available at http://dx.doi.org/10.1016/S1571-0661(04)00019-2.
Neil D. Jones (1999):
logspace and ptime Characterized by Programming Languages.
Theoretical Computer Science 228(1-2),
pp. 151–174.
Available at http://dx.doi.org/10.1016/S0304-3975(98)00357-0.
Neil D. Jones, Carsten K. Gomard & Peter Sestoft (1993):
Partial Evaluation and Automatic Program Generation.
Prentice-Hall.
Oleg Kiselyov (2011):
Investigations into Kleene's 2nd recursion theorem.
Technical Report.
Fleet Numerical Meteorology and Oceanography Center,
http://okmij.org/ftp/Haskell/Kleene.hs.
Stephen Cole Kleene (1938):
On Notation for Ordinal Numbers.
Journal of Symbolic Logic 3(4),
pp. 150–155.
Available at http://dx.doi.org/10.2307/2267778.
Michael Machtey & Paul Young (1978):
An introduction to the general theory of algorithms.
Theory of computation series.
North-Holland,
New York.
Jean-Yves Marion (2012):
From Turing machines to computer viruses.
In: Philosophical transactions of the Royal Society A,
Lecture Notes in Computer Science 370.1971.
Royal Society publishing,
pp. 3319–3339.
Available at http://dx.doi: 10.1098/rsta.2011.0332.
John McCarthy (1960):
Recursive Functions of Symbolic Expressions and Their Computation by Machine.
Communications of the Association for Computing Machinery (CACM) 3(4),
pp. 184–195.
Available at http://doi.acm.org/10.1145/367177.367199.
Marvin Minsky (1967):
Computation: Finite and Infinite Machines.
Prentice-Hall Series in Automatic Computation.
Torben Æ. Mogensen (1996):
Evolution of partial evaluators: removing inherited limits.
In: Partial Evaluation. Proceedings, LNCS 1110, 303Ð321.
Springer-Verlag,
pp. 303–321.
Available at http://dx.doi.org/10.1007/3-540-61580-6_15.
Torben Æ. Mogensen (2000):
Linear-Time Self-Interpretation of the Pure Lambda Calculus.
Higher-Order and Symbolic Computation 13(3),
pp. 217–237.
Available at http://dx.doi.org/10.1023/A:1010058213619.
Yiannis N. Moschovakis (2010):
Kleene's amazing Second Recursion Theorem.
Bulletin of Symbolic Logic 16(2),
pp. 189–239.
Available at http://dx.doi.org/10.2178/bsl/1286889124.
Lawrence S. Moss (2006):
Recursion Theorems and Self-Replication Via Text Register Machine Programs.
Bulletin of the European Association for Theoretical Computer Science 89,
pp. 171–182.
John C. Shepherdson & Howard E. Sturgis (1961):
Computability of Recursive Functions.
Journal of the Association for Computing Machinery (JACM) 10,
pp. 217–255.
Available at http://dx.doi.org/10.1145/321160.3 21170.
Ken Thompson (1984):
Reflections on trusting trust.
Communications of the Association for Computing Machinery (CACM) 27(8),
pp. 761–763.
Available at http://doi.acm.org/10.1145/358198.358210.
Alan M. Turing (1936-7):
On Computable Numbers with an Application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society 42(2),
pp. 230–265.
eptcs@eptcs.org