论文信息 - Automating recursive type definitions in higher order logic - 字舞流文

Automating recursive type definitions in higher order logic

[1] M. Gordon. HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[2] Richard S. Bird,et al. Introduction to functional programming , 1988, Prentice Hall International series in computer science.

[3] Lawrence C. Paulson,et al. Logic and computation - interactive proof with Cambridge LCF , 1987, Cambridge tracts in theoretical computer science.

[4] M. Gordon. HOL : A machine oriented formulation of higher order logic , 1985 .

[5] Joseph A. Goguen,et al. ALGEBRAS, THEORIES AND FREENESS: AN INTRODUCTION FOR COMPUTER SCIENTISTS , 1982 .

[6] Michael J. C. Gordon,et al. Edinburgh LCF: A mechanised logic of computation , 1979 .

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

[8] A. Leisenring. Mathematical logic and Hilbert's ε-symbol , 1971 .

[9] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.