论文信息 - Incremental polymorphic type checking in B

Incremental polymorphic type checking in B

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.

Lambert G. L. T. Meertens | L. Meertens

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] S BoyerRoger,et al. Ttle sharing of structure in theorem proving programs , 1972 .

[3] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[4] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[5] Norihisa Suzuki,et al. Inferring types in Smalltalk , 1981, POPL '81.

[6] Narain H. Gehani. Generic Procedures: An Implementation and an Undecidability Result , 1980, Comput. Lang..

[7] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[8] Alan Borning,et al. A type declaration and inference system for smalltalk , 1982, POPL '82.

[9] Lambert G. L. T. Meertens,et al. Draft proposal for the B programming language: semi-formal definition , 1981 .

[10] Alan J. Demers,et al. Data types, parameters and type checking , 1980, POPL '80.