Extracting Recursion Operators in Nuprl's Type Theory (2001)

by James L. Caldwell
Venue:Eleventh International Workshop on Logic -based Program Synthesis, LOPSTR-02, volume 2372 of LNCS
Citations:2 - 2 self

Documents Related by Co-Citation

156 Implementing Mathematics with The Nuprl Proof Development System – Robert L. Constable, Stuart F. Allen, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, Scott F. Smith, James T. Sasaki, S. F. Smith - 1986
573 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
406 Deforestation: transforming programs to eliminate trees – P Wadler - 1988
302 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
269 Constructive mathematics and computer programming – P Martin-Löf - 1982
148 Lego proof development system: User's manual – Z Luo, R Pollack - 1992
147 Proofs and refutations: The logic of mathematical discovery – I Lakatos - 1976
84 Algebraic data types and program transformation – G Malcolm - 1990
83 Combining programming with theorem proving – Chiyan Chen, Hongwei Xi - 2005