Cambridge University Press 1.1 Time Clock User Manual


  Open as PDF
of 116
 
BIBLIOGRAPHY 107
Milner, R. (1978) A theory of type polymorphism in programming. Journal of
Computer and Systems Sciences, 17, 348–375.
Paulson, L. C. (1983) A higher-order implementation of rewriting. Science of Com-
puter Programming, 3, 119–149.
Paulson, L. C. (1987) Logic and computation: interactive proof with Cambridge
LCF, Volume 2 of Cambridge Tracts in Theoretical Computer Science. Cambridge
University Press.
Paulson, L. C. (1991) ML for the Working Programmer. Cambridge University
Press.
Prawitz, D. (1965) Natural deduction; a proof-theoretical study, Volume 3 of Stock-
holm Studies in Philosophy. Almqvist and Wiksells.
Raphael, B. (1966) The structure of programming languages. Communications of
the ACM , 9, 155–156.
Rudnicki, P. (1992) An overview of the MIZAR project. Available on the Web as
http://web.cs.ualberta.ca/~piotr/Mizar/MizarOverview.ps.
Sch¨onfinkel, M. (1924)
¨
Uber die Bausteine der mathematischen Logik. Mathema-
tische Annalen, 92, 305–316. English translation, ‘On the building blocks of
mathematical logic’ in Heijenoort (1967), pp. 357–366.
Stickel, M. E. (1988) A Prolog Technology Theorem Prover: Implementation by an
extended Prolog compiler. Journal of Automated Reasoning, 4, 353–380.
Tarski, A. (1936) Der Wahrheitsbegriff in den formalisierten Sprachen. Studia Philo-
sophica, 1, 261–405. English translation, ‘The Concept of Truth in Formalized
Languages’, in Tarski (1956), pp. 152–278.
Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific
Journal of Mathematics, 5, 285–309.
Tarski, A. (ed.) (1956) Logic, Semantics and Metamathematics. Clarendon Press.
Weis, P. and Leroy, X. (1993) Le langage Caml. InterEditions. See also the CAML
Web page: http://pauillac.inria.fr/caml/.
Whitehead, A. N. and Russell, B. (1910) Principia Mathematica (3 vols). Cambridge
University Press.
Wittgenstein, L. (1922) Tractatus Logico-Philosophicus. Routledge & Kegan Paul.
Wright, A. (1996) Polymorphism for imperative languages without imperative types.
Technical Report TR93-200, Rice University.
 previous