Abstract
In this paper we investigate the design of realizability interpretations for program development in extensions to the constructive and intensional set theory TK [Henson 88]. These realizability interpretations express the idea that a program meets a specification. We explore a variety of topics including, unwanted data, polymorphism, data abstraction, types and typechecking, conditional assertions, let assertions, pattern directed invocation and recursion equations. Our aim is to ensure that, when constructive reasoning is harnessed for the derivation of programs from proofs of specifications, the programs we obtain are expressed in a natural way.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6 References
Abbas, A., Programming with types and rules in Martin-Lof's theory of types, Ph.D. thesis, London University, 1987
Backhouse, R., Overcoming the mismatch between programs and proofs, Proc. workshop on programming logic, pp 116–122, Marstrand, June 1987.
Backhouse, R., et al, Do-it-yourself type theory, tech. rep. CS 8811, Dept. Maths. and computing science, University of Gronigen, 1988; to appear: Formal aspects of computing, 1989.
Beeson, M. J., Foundations of constructive mathematics, Springer Verlag, 1985
Beeson, M. J., Proving programs and programming proofs, Logic, Methodology and Philosophy of Science VII, North Holland, pp 51–82, 1986
Beeson, M. J., Towards a computation system based on set theory, tech. rep., Dept. Maths. and Computer Sciences, San Jose state University, 1988
Burstall, R. and Lampson, B., A kernel language for abstract data types and modules, symp. on semantics of data types, LNCS Vol. 173, pp 1–50, Springer, 1984
Constable, R. et al, Implementing mathematics with the NuPRL proof development system, Prentice Hall, 1986
Dummett, M., Elements of Intuitionism, Clarendon Press, Oxford, 1977
Feferman, S., Constructive theories of functions and classes, Logic Coll. '78., pp 159–224, North Holland, 1979
Hayashi, S. and Nakano, H., The PX system — a computational logic, Publications of the Research Institute for Mathematical Sciences, Kyoto University, Tokyo, 1987
Henson, M. C. and Turner, R., A constructive set theory for program development, Proc. 8th conf. on FST & TCS, LNCS vol. 338, Springer, pp 329–347, 1988
Henson, M. C., Transformational programming, type simulations and intensional set theory, submitted to: ACM trans. prog. lang. and sys., also: Tech. Rep. CSM-121 Dept. Computer Science, University of Essex, October, 1988
Henson, M. C., Program development in the constructive set theory TK, To appear: Formal Aspects of Computing, 1989
Kleene, S. C., On the interpretation of intuitionistic number theory, J. symb. logic, 10, pp 109–124, 1945
Kleene, S. C., Realizability: a retrospective survey, Proc. Cambridge summer school in mathematical logic, pp 95–113, 1971
Kreisel, G. and Troelstra, A., Formal systems for some branches of intuitionistic analysis, Annals of math. logic., Vol. 1, pp 229–387, 1970
Leivant, D., Polymorphic type inference, Proc. 10th ACM symp. on principles of programming languages, 1983
McQueen, D. and Sethi, R., A semantic model of types for applicative programming languages, Proc. ACM symp. LISP and functional programming, pp 243–252, 1982
Martin-Lof, P., Constructive mathematics and computer programming, Logic, methodology and philosophy of science VI, North Holland, 1982
Mitchell, J. and Plotkin, G., Abstract types have existential type, Proc. 12th ACM conf. on principles of programming languages, pp 37–51, 1985
Nordstrom, B., Terminating general recursion, Tech. rep., University of Goteborg, Programming methodology group, 1987
Reynolds, J. C., Towards a theory of type structures, Proc. programming symposium, LNCS Vol. 19, Springer, 1974
Turner, D. A., Miranda TM: a non strict functional language with polymorphic types, Proc. conf. on functional programming and computer architecture, LNCS Vol. 201, pp 445–472, 1985TM Miranda is a trademark of Research Software Limited.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henson, M.C. (1989). Realizability models for program construction. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-51305-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51305-6
Online ISBN: 978-3-540-46191-3
eBook Packages: Springer Book Archive