Should your specification language be typed?

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 3, 1999, Pages 502-526

  Lamport, Leslie ^a   Paulson, Lawrence C ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Set theory; Specification; Types

Indexed keywords

POLYMORPHISM;

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; ERROR ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0003897323     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/319301.319317     Document Type: Article

References (45)

1. APT, K. R. AND OLDEROG, E.-R. 1990. Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, London, Paris, Tokyo, Hong Kong, Barcelona.
2. BARRAS, B., BOUTIN, S., CORNES, C., COURANT, J., FILLIBTRE, J.-C., GIMINEZ, E., HERBELIN, H., HUET, G., MUQOZ, C., MURTHY, C., PARENT, C., PAULIN-MOHRING, C., SAOBI, A., AND WERNER, B. 1997. The Coq proof assistant reference manual : Version 6.1. Technical Report RT-0203 (May), INRIA-Rocquencourt. Version 5.8.
3. BOYER, R. S. AND MOORE, J. S. 1988. A Computational Logic Handbook. Academic Press.
4. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design. Addison-Wesley, Reading, Massachusetts.
5. CONSTABLE, R. L., ALLEN, S. F., BROMLEY, H. M., CLEAVELAND, W. R., CREMER, J. F., HARPER, R. W., HOWE, D. J., KNOBLOCK, T. B., MENDLER, N. P., PANAGADEN, P., SASAKI, J. T., AND SMITH, S. F. 1986. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall.
6. COQUAND, T. 1990. Metamathematical investigations of a calculus of constructions. In P. ODIFREDDI (Ed.), Logic and Computer Science, pp. 91-122. Academic Press.
7. DE BRUIJN, N. G. 1995. On the roles of types in mathematics. In P. DE GROOTE (Ed.), The Curry-Howard isomorphism, pp. 27-54. Academia.
8. DUMMETT, M. 1977. Elements of Intuitionism. Oxford University Press.
9. ENGBERG, U., GRØNNING, P., AND LAMPORT, L. 1992. Mechanical verification of concurrent systems with TLA. In G. v. BOCHMANN AND D. K. PROBST (Eds.), Proceedings of the Fourth International Conference on Computer Aided Verification, Volume 663 of Lecture Notes in Computer Science, Berlin, pp. 44-55. Springer-Verlag. Proceedings of the Fourth International Conference, CAV'92.
10. FARMER, W. M. 1990. A partial functions version of church's simple theory of types. Journal of Symbolic Logic 55, 3, 1269-1291.
11. FISHER, K. AND MITCHELL, J. C. 1995. The development of type systems for object-oriented languages. Theory and Practice of Object Systems 1, 3, 189-220.
12. FITZGERALD, J. S., LARSEN, P. G., BROOKES, T. M., AND GREEN, M. A. 1995. Developing a security-critical system using formal and conventional methods. In M. HINCHEY AND J. P. BOWEN (Eds.), Applications of Formal Methods, pp. 333-356. Prentice-Hall.
13. GARLAND, S. J. AND GUTTAG, J. V. 1989. An overview of LP, the Larch Prover. In N. DERSHOWITZ (Ed.), Proceedings of the Third International Conference on Rewriting Techniques and Applications, Volume 355 of Lecture Notes on Computer Science, pp. 137-151. Springer-Verlag.
14. GÖDEL, K. 1983. Russell's mathematical logic. In P. BENACERRAF AND H. PUTNAM (Eds.), Philosophy of Mathematics: Selected Readings (2nd ed.). Cambridge University Press. First published in 1944.
15. GORDON, M. J. C. AND MELHAM, T. F. 1993. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press.
16. GRIES, D. 1981. The Science of Programming. Springer-Verlag.
17. GRIES, D. AND SCHNEIDER, F. B. 1993. A Logical Approach to Discrete Math. Springer-Verlag, New York.
18. GUNTER, C. A. AND SCOTT, D. S. 1990. Semantic domains. In J. VAN LEEUWEN (Ed.), Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pp. 633-674. Elsevier.
19. GUTTAG, J. V. AND HORNING, J. J. 1978. The algebraic specification of abstract data types. Acta Informatica 10, 27-52.
20. HALMOS, P. R. 1960. Naive Set Theory. Van Nostrand.
21. HEHNER, E. C. R. 1984. Predicative programming. Commun. ACM 27, 2 (Feb.), 134-151.
22. HUDAK, P., JONES, S. P., AND WADLER, P. 1992. Report on the programming language Haskell: A non-strict, purely functional language. SIGPLAN Notices 27, 5 (May). Version 1.2.
23. HUET, G. 1997. Re: types and extremism. Email to Leslie Lamport. Internet message sent on April 25, 1997 23:11:37 MET DST, number 199704252111.XAA19096@pauillac.inria.fr.
24. KAUFMANN, M. AND MOORE, J. S. 1996. ACL2: An industrial strength version of Nqthm. In Proceedings of the Eleventh Annual Conference on Computer Assurance (COMPASS-96), pp. 23-34. IEEE Computer Society Press.
25. LAM, S. S. AND SHANKAR, A. U. 1984. Protocol verification via projections. IEEE Transactions on Software Engineering SE-10, 4 (July), 325-342.
26. LEISENRING, A. C. 1969. Mathematical Logic and Hilbert's ε-Symbol. Gordon and Breach, New York.
27. MANNA, Z. AND PNUELI, A. 1991. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, New York.
28. MELHAM, T. F. 1989. Automating recursive type definitions in higher order logic. In G. BIRTWISTLE AND P. A. SUBRAHMANYAM (Eds.), Current Trends in Hardware Verification and Automated Theorem Proving, pp. 341-386. Springer.
29. MILNER, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 348-375.
30. MITCHELL, J. C. 1991. Type inference with simple subtypes. Journal of Functional Programming 1, 3 (July), 245-285.
31. NELSON, G. (Ed.) 1991. Systems Programming with Modula-3. Series in Innovative Technology. Prentice-Hall, Inc., Englewood Cliffs, New Jersey.
32. OWRE, S. 1998. PVS 2.1 patches (2.417). Email to pvs@csl.sri.com. Internet message sent on Sat, Feb 7, 1998 02:53:40-0800, number 199802071053.CAA02273@lotus.csl.sri.com.
33. OWRE, S., RUSHBY, J., SHANKAR, N., AND VON HENKE, F. 1995. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering 21, 2 (Feb.), 107-125.
34. PAULSON, L. C. 1985. Verifying the unification algorithm in LCF. Science of Computer Programming 5, 143-170.
35. PAULSON, L. C. 1993. Set theory for verification: I. From foundations to functions. Journal of Automated Reasoning 11, 3, 353-389.
36. PAULSON, L. C. 1994a. A fixedpoint approach to implementing (co)inductive definitions. In A. BUNDY (Ed.), 12th International Conference on Automated Deduction, LNAI 814, pp. 148-161. Springer.
37. PAULSON, L. C. 1994b. Isabelle: A Generic Theorem Prover. Springer. LNCS 828.
38. PAULSON, L. C. 1995. Set theory for verification: II. Induction and recursion. Journal of Automated Reasoning 15, 2, 167-215.
39. PAULSON, L. C. 1996. ML for the Working Programmer (2nd ed.). Cambridge University Press.
40. QUAIFE, A. 1992. Automated deduction in von Neumann-Bernays-Gödel set theory. Journal of Automated Reasoning 8, 1, 91-147.
41. SCOTT, D. 1979. Identity and existence in intuitionistic logic. In M. P. FOURMAN (Ed.), Applications of Sheaves, pp. 660-696. Springer. Lecture Notes in Mathematics 753.
42. THOMPSON, S. 1991. Type Theory and Functional Programming. Addison-Wesley.
43. WADLER, P. AND BLOTT, S. 1989. How to make ad-hoc polymorphism less ad hoc. In 16th Annual Symposium on Principles of Programming Languages, pp. 60-76. ACM Press.
44. WHITEHEAD, A. N. AND RUSSELL, B. 1962. Principia Mathematica. Cambridge University Press. Paperback edition to *56, abridged from the 2nd edition (1927).
45. WRIGHT, A. K. AND CARTWRIGHT, R. 1997. A practical soft type system for Scheme. ACM Trans. on Programm. Lang. Syst. 19, 1 (Jan.), 87-152.