• Corpus ID: 16322191

Theorem proving and program synthesis with Oyster

@inproceedings{Horn1992TheoremPA,
  title={Theorem proving and program synthesis with Oyster},
  author={Christian Horn and Alan Smaill},
  year={1992}
}
Martin-LL of type theory provides a formal framework for the construction of veri-ed programs, both speciied and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by describing the synthesis of a simple evaluator for arithmetic expressions in the system. 
The use of proof plans for transformation of functional programs by changes of data type
TLDR
This thesis presents an automated technique for transforming a program by changing the data types in that program to ones which are more appropriate for the task, and present an automated proof strategy for synthesis theorems of this form which requires very little search.
Supporting Programming by Analogy in the Learning of Functional Programming Languages
TLDR
A novel editor for ML is presented which supports programming by analogy by providing a collection of editing commands that transform old programs into new ones and restricts the editor such that it is impossible to commit these errors.
Higher-Order Attribute Semantics of Flat Languages
TLDR
A higher-order attribute evaluation planning algorithm using a concept of maximal linear branches is presented, and the results show that only two of the provers performed better than the CoCoViLa’s algorithms.
An Editor for Helping Novices to Learn Standard ML
TLDR
A novel editor for ML is presented which supports programming by analogy by providing a collection of editing commands that transform old programs into new ones by making changes to an isolated part of the program using analogical techniques.
for Helping Novices to Learn Standard ML
TLDR
An Editor for Helping Novices to Learn Standard ML is an editor for helping novice programmers learn standard ML.
The use of data-mining for the automatic formation of tactics
TLDR
The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs to find commonly occurring patterns.

References

SHOWING 1-10 OF 13 REFERENCES
A computational logic handbook
Extracting ω's programs from proofs in the calculus of constructions
TLDR
This paper defines a notion of realizability for the Calculus of Constructions and introduces a distinction between informative and non-informative propositions that allows the removal of the “logical” part in the development of a program.
Implementing mathematics with the Nuprl proof development system
TLDR
This ebook presents full variant of this ebook in DjVu, PDF, ePub, doc, txt forms, and on the website you may read guides and different art eBooks online, either downloading or downloading.
Constructive mathematics and computer programming. In 6th Inter- national Congress for Logic, Methodology and Philosophy of Science, pages 153{175
  • 1979
Hoare's Logic in the LF
The CLAM proof planner, user manual and programmer manual
  • Technical Paper TP-4, Dept. of Arti cial Intelligence,
  • 1989
The Nurprl proof development system. Working paper 214, Dept. of Artiicial Intelligence, Edinburgh, 1988. The Edinburgh version of Nurprl has been renamed Oyster
  • The Nurprl proof development system. Working paper 214, Dept. of Artiicial Intelligence, Edinburgh, 1988. The Edinburgh version of Nurprl has been renamed Oyster
The CLAM proof planner, user manual and programmer manual
  • Dept. of Artiicial Intelligence
  • 1989
Programming in Martin-LL of Type Theory
  • Programming in Martin-LL of Type Theory
  • 1990
...
...