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

151 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
3 Program Transformations in Nuprl – Tjark Weber - 2002
2 NuprlPrimitives - Explanations of Nuprl Primitives and Conventions – Stuart Allen - 2003
8 Constructive mathematics and computer programming – P Martin-L of - 1982
22 Fold and Unfold for Program Semantics – Graham Hutton - 1998
9 When is a function a fold or an unfold – Jeremy Gibbons, Graham Hutton, Thorsten Altenkirch - 2001
21 Functional algorithm design – Richard S Bird - 1995
49 The Under-Appreciated Unfold – Jeremy Gibbons, Geraint Jones - 1998
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
84 Algebraic Data Types and Program Transformation – G Malcolm - 1990
58 A tutorial on the universality and expressiveness of fold – Graham Hutton - 1999
46 Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics – S MacLane - 1971
264 Constructive mathematics and computer programming – P Martin-Lof - 1982
574 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
1 Version 6.1 – Manual - 1997
10 shapely functors and traversals – Monads - 1998
3 Changing Data Structures in Type Theory: a study of natural numbers – Nicolas Magaud, Yves Bertot, Inria Sophia Antipolis - 2000
8 Search algorithms in type theory – James L. Caldwell, Ian P. Gent, Judith Underwood - 2000