Type-Checking in an Untyped Language
暂无分享,去创建一个
Abstract It is argued that typed variables and functions are inappropriate for languages which allow functional arguments, data types defined by predicates, and conditional expressions that test data types. However, it is still possible to do some compile-time type-checking for such languages. This paper presents a technique for inferring data types in an untyped language, and a program that uses this technique to show where type constraints are obeyed or violated and where run time checks are needed.
[1] Marvin Minsky,et al. A framework for representing knowledge , 1974 .
[2] William F. Clocksin,et al. Programming in Prolog , 1987, Springer Berlin Heidelberg.
[3] Ira P. Goldstein. Understanding simple picture programs , 1974 .
[4] James C. King,et al. A Program Verifier , 1971, IFIP Congress.
[5] Gerald Jay Sussman,et al. Why Conniving is Better than Planning , 1972 .
[6] Rod M. Burstall,et al. Programming in POP-2 , 1971 .