RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice

被引:2
作者
Bauer, Andrej [1 ]
Stone, Christopher A. [2 ]
机构
[1] Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia
[2] Harvey Mudd Coll, Dept Comp Sci, Claremont, CA 91711 USA
关键词
D O I
10.1093/logcom/exn026
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce code interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between the worlds of constructive mathematics and programming. By using the realizability interpretation of constructive mathematics, RZ translates specifications in constructive logic into annotated interface code in Objective Caml. The system supports a rich input language allowing descriptions of complex mathematical structures. RZ does not extract code from proofs, but allows any implementation method, from handwritten code to code extracted from proofs by other tools.
引用
收藏
页码:17 / 43
页数:27
相关论文
共 38 条
[1]  
[Anonymous], THESIS CARNEGIE MELL
[2]  
[Anonymous], 1988, STUDIES LOGIC FDN MA
[3]  
[Anonymous], 1947, The Journal of Symbolic Logic, DOI [10.2307/2267170, DOI 10.2307/2267170]
[4]  
[Anonymous], J SYMBOLIC LOGIC
[5]  
[Anonymous], 1988, STUDIES LOGIC FDN MA
[6]  
Barwise J., 1975, Admissible Sets and Structures, V7
[7]   Equilogical spaces [J].
Bauer, A ;
Birkedal, L ;
Scott, DS .
THEORETICAL COMPUTER SCIENCE, 2004, 315 (01) :35-59
[8]  
BAUER A, 2007, ELECT NOTES IN PRESS
[9]  
Bauer A, 2007, LECT NOTES COMPUT SC, V4497, P28
[10]   Specifications via Realizability [J].
Bauer, Andrej ;
Stone, Christopher A. .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 153 (01) :77-92