Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Higher-order modules and the phase distinction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The definition of extended ML: a gentle introduction
Theoretical Computer Science - Special issue: algebraic development techniques
Complexity and real computation
Complexity and real computation
When is a functional program not a functional program?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Computable analysis: an introduction
Computable analysis: an introduction
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Developing theories of types and computability via realizability
Developing theories of types and computability via realizability
The realizability approach to computable analysis and topology
The realizability approach to computable analysis and topology
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Theoretical Computer Science - Mathematical foundations of programming semantics
Semantics of a Sequential Language for Exact Real-Number Computation
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Specifications via Realizability
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing Real Numbers With RZ
Electronic Notes in Theoretical Computer Science (ENTCS)
Minlog: a tool for program extraction supporting algebras and coalgebras
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
Realizability theory can produce interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between constructive mathematics and programming by translating 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.