Type Theory and Functional Programming, Simon Thompson, 1999.
A Basis for a Mathematical Theory of Computation, John McCarthy, 1963.
Equality in Lazy Computation Systems, Douglas Howe, 1989
General Recursive Functions, Introduction to Metamathematics, p.270-275, S.C Kleene, 1971
Recursive Number Theory, p.1-11, R. L. Goodstein, 1957.
Partial Recursive Functions, Introduction to Metamathematics, p.348-351, S.C Kleene, 1971.
Computational foundations of basic recursive function theory, Robert Constable and Scott Smith. Theoretical Copmuter Science, v.121, p.89-122, 1989.
Introduction to operational semantics, from "The Formal Semantics of Programming Languages: An introduction", Glynn Winskel, 1993.
Tachniques for recursion, from "The Formal Semantics of Programming Languages: An Introduction", Glynn Winskel, 1993.
Computational Complexity and Program Structure, A.R. Meyer and D.M. Ritchie, IBM Research, 1967.
A Critique of the Foundations of Hoare-Style Programming Logics, Michael O'Donnell, Technical Report, Purdue University, 1980
The Basic Nuprl Type Theory, Christoph Kreitz.
The Triumph of types: Principia Mathematica's Impact on Computer Science, Robert Constable.
The Unlimited Register Machine from Computability: An Introduction to recursive function theory,pp. 8-13, N.J. Cutland, 1980.
Turing Machines, from Formal Languages and Their Relation to Automata, pp. 80-83, John E. Hopcroft an Jeffrey D. Ullman, 1969.
The Brouwer-Hilbert Controversy, from Brouwer's Intuitionism, Vol. 2, pg. 100-103, W.P. van Stigt, 1990.
Derivation of a Fast Integer Square Root Algorithm, Christoph Kreitz.