Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Programming + Verification = Progification Thorsten Altenkirch
 

Summary: Programming + Verification = Progification
(Draft)
Thorsten Altenkirch
September 94
Abstract
We discuss the r^ole Type Theory should play in the formal develop-
ment of correct programs. We view verification as a programming problem
in a sophisticated programming language and evaluate this approach by
presenting a number of examples developed in the ALF system. Thereby
we exploit the recent advantages in the presentation of Type Theory in
particular by using pattern matching as proposed in [Coq92].
1 Introduction
The steps in the development of a software system can be classified in ex-
ploration and consolidation. Exploratory steps are the implementation of
a prototype or the experimental addition of new features to an existing sys-
tem. Examples of consolidation are debugging, testing, extending and updating
documentation, etc.
One important objective of a good software development methodology is to
support consolidation without making exploration too hard. We have to reject
an anarchic approach to software development (hacking) because it ignores the

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences