Dependently Typed Programming based on Automated Theorem Proving

Details Dependently Typed Programming based on Automated Theorem Proving Dependently Typed Programming based on Automated Theorem Proving

2011-12-16

arxiv.org/abs/1112.3833v1

Computer Science

Programming Languages

Scientific paper

Mella is a minimalistic dependently typed programming language and interactive theorem prover implemented in Haskell. Its main purpose is to investigate the effective integration of automated theorem provers in a pure and simple setting. Such integrations are essential for supporting program development in dependently typed languages. We integrate the equational theorem prover Waldmeister and test it on more than 800 proof goals from the TPTP library. In contrast to previous approaches, the reconstruction of Waldmeister proofs within Mella is quite robust and does not generate a significant overhead to proof search. Mella thus yields a template for integrating more expressive theorem provers in more sophisticated languages.

Affiliated with

Also associated with

No associations

Rating

Dependently Typed Programming based on Automated Theorem Proving does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dependently Typed Programming based on Automated Theorem Proving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependently Typed Programming based on Automated Theorem Proving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137044