This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N.G.de Bruijn, A Survey of the Project AUTOMATH, in: J.P.Seldin and J.R.Hindley (editors), To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, Prentice Hall, 1980.
R.M.Burstall, Transformational System for Developing R ecursive Programs, JACM 24(1), pp.44–67.
J.Carbonell, Derivational Analogy: A Theory of Reconstructive Problem Solving and Expertise Acquisition, in R.S. Michalski et al(ed.), Machine Intelligence: An Artificial Intelligence Approach, Morgan Kaufmann, 1986.
R. Constable, et al, Implementing Mathematics with NuPRL Proof Development System, Prentice Hall, 1985.
John Darlington, An Experimental Program transformation and Synthesis System, Artificial Intelligence 16(1981), pp. 1–46.
Nachum Dershowitz, Programming By Analogy, in R.S.Michalski et al (eds.), Machine Learning II: An Artificial Intelligence Approach,Morgan Kaufmann, 1986.
R. Harper, F.A.Honsell, G.Plotkin, A Framework for Defining Logics, Proceedings of the second symposium on Logic in Computer Science, PP. 194–204, IEEE, 1986.
W.A.Howard, The Formula as Types Notion of Construction, in: J.P.Seldin and J.R.Hindley (editors), To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, Prentice Hall, 1980.
Jianguo Lu, Research on Analogical Program Derivation Based on Type Theory, Ph.D. Dissertation, Nanjing University, 1991.
P.Madden, Automatic Programming Optimization via the Transformation of NuPRL Synthesis Proofs, UK IT 88 Conference Publication, Swansea, UK, 4–7 July, 1988.
Per Martin-Lof, Constructive Mathematics and Computer Programming, in Logic, Methodology and Philosophy of Science, pp.153–175, North Holland, 1982.
J. Mostow, Design by Derivational Analogy: Issues in the Automated Replay of Design Plans, Artificial Intelligence 40(1989), pp.119–184.
R.P.Nederpelt, An approach to theorem proving on the basis of typed lambda calculus, 5th Conference on Automated Deduction, LNCS 87, pp.181–190, 1980.
M. Sintzoff, Understanding and Expressing Software Construction, in P.Pepper(ed.), Program Transformation and Programming Environment, Springer, 1984.
M. Weber, A Meta Calculus for Formal System Development, Ph.D. Dissertation, der Universitat Karlsruhe, 1990.
Jiafu Xu, Reports on a Software Automation R & D Project, Information Processing '89, G.X.Ritter(ed.), Elsevier Science Publisher, B.V.(North-Holland), Aug. 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, J., Xu, J. (1992). Development transformation based on higher order type theory. In: Myers, J.P., O'Donnell, M.J. (eds) Constructivity in Computer Science. Constructivity in CS 1991. Lecture Notes in Computer Science, vol 613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021083
Download citation
DOI: https://doi.org/10.1007/BFb0021083
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55631-2
Online ISBN: 978-3-540-47265-0
eBook Packages: Springer Book Archive