Results

**11 - 13**of**13**### Domain-Theoretic Methods for Program Synthesis

"... formal proofs. A recent outcome of this analysis is the development of computer systems for automated or interactive theorem proving that can for instance be used for computer aided program verication. An example of such a system is the interactive theorem prover Minlog developed by the logic group ..."

Abstract
- Add to MetaCart

formal proofs. A recent outcome of this analysis is the development of computer systems for automated or interactive theorem proving that can for instance be used for computer aided program verication. An example of such a system is the interactive theorem prover Minlog developed by the logic group at the University of Munich (7). As a former member of this group I was mainly involved in the theoretical background steering the implementation of the system. The system also exploits the so-called proofs-as-programs paradigm as a logical approach to correct software development: from a formal proof that a certain specication has a solution one fully automatically extracts a program that provably meets the specication. We carried out a number of extended case studies extracting programs from proofs in areas such as arithmetic (6), graph theory (7), innitary combinatorics (7), and lambda calculus (1,2). Special emphasis has been put on an ecient implemen

### The King's Buildings Edinburgh EH9 3JZ, Scotland

"... We provide an internal characterization of the category!-Cpo of!-complete posets and!-continuous functions within the model H of SDT recently introduced by the authors. It follows that!-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness. ..."

Abstract
- Add to MetaCart

We provide an internal characterization of the category!-Cpo of!-complete posets and!-continuous functions within the model H of SDT recently introduced by the authors. It follows that!-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness.