Incremental polymorphic type checking in B

ABSTRACT

The programming language B has been designed for personal computing. In B, variables need not be declared, nor formal parameters specified. Nevertheless, B is strongly typed. All type requirements can be checked statically. To signal type violations on the spot during editing, the computations can be organized so that local the source text require a modest amount of recomputation.

REFERENCES

• 1: Alan H. Borning , Daniel H. H. Ingalls, A type declaration and inference system for smalltalk, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.133-141, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582168]
• 2: BOYER, R. S. & J. S MOORE, The sharing of structure in theorem proving programs, Machine Intelligence 7, 101-116, (B. Metzer & D. Michie, eds.), Edinburgh University Press, 1972.
• 3: Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
• 4: Alan J. Demers , James E. Donahue, Data types, parameters and type checking, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-23, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567448]
• 5: GEHANI, N., Generic procedures: an implementation and an undecidability result, Comp. Languages 5 (1980) 155-161.
• 6: GEURTS, L. J. M. & L. G. L. T. MEERTENS. Designing a beginners' programming language, New Directions in Programming Languages 1975, 1-18, (S. A. Schuman, ed.), IRIA, Rocquencourt, 1976.
• 7: Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
• 8: LANGMAACK, H., On correct procedure parameter transmission in higher programming languages, Acta Informatica 2 (1973) 110-142.
• 9: MEERTENS, L. G. L. T., Draft Proposal for the B Programming Language-Semi-Formal Definition, Mathematical Centre, Amsterdam, 1981.
• 10: MILNER, R., A theory of type polymorphism in programming, J. Computer and System Sciences 17 (1978) 348-375.
• 11: J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
• 12: Norihisa Suzuki, Inferring types in Smalltalk, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.187-199, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567553]
• 13: TENENBAUM, A. M., Type determination for very high-level languages, Comp. Sci. Rep. NSO-3, Courant Institute of Mathematical Sciences, NYU, New York, 1974.