D. Galmiche  Home/Search
Context Related
| loria.fr/~galmiche/infor91.ps.Z loria.fr/~galmiche/=pape...Infor91.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~galmiche/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper aims at presenting the notion of program transformation by proof in type theory and programming with proofs framework. In such framework, programs obtained from proofs are not always efficient and the relationships between programs and good proofs have to be studied. Automatic synthesis and verification of programs have been tackled in the constructive type theory and we are interested by the transformational approach, with some degree of automation, in such a framework. We present... (Update)
Context of citations to this paper: More
.... and proof transformation in constructive logic and its representation in logical frameworks has been the subject of recent research [9, 8, 1]. In this paper we show some results in an attempt to formalize the program transformation process in Martin Lof s theory of sets (MTS)...
.... programs by Dijkstra and others [Dij76, Dah92] or those of program transformation [BD77, Bir89, Par90] and proof transformation [And93, Gal91] Also, 1) makes it possible in principle to give more perspicuous specifications of general (higher order) functions, as for instance...
Cited by: More
Type Theory and Functional Programming: a work proposal - Betarte, Bove, Cabezas.. (1997) (Correct)
Program Transformation in Martin-Löf's Type Theory - Pardo, Rosa (1994) (Correct)
Active bibliography (related documents): More All
0.6: Transformational Derivation in the Programming Logic TK - Martin Henson (1992) (Correct)
0.6: Automated Proof and Program Development - Galmiche, Hermann (1992) (Correct)
0.5: Formal Mathematics for Verifiably Correct Program Synthesis - Christoph Kreitz (1996) (Correct)
Similar documents based on text: More All
0.1: Correctness and Metatheoretic Extensibility of Automated.. - This One-Day (Correct)
0.1: A Procedure for Automatic Proof Nets Construction - Galmiche, Perrier (1992) (Correct)
0.1: Proofs, concurrent objects and computations in a FILL framework - Galmiche, Boudinet (1995) (Correct)
Related documents from co-citation: More All
2: Programming in Martin-Lof's Type Theory: An Introduction (context) - Nordstrom, Petersson et al. - 1990
2: A transformation system for developing recursive programs - Burstall, Darlington - 1977
2: Introduction to Functional Programming (context) - Bird, Wadler - 1988
BibTeX entry: (Update)
D. Galmiche. Program transformation by proof in constructive framework. In Informatika'91, Theoretical Computer Science and Methods of Compilation and Program Construction, 1991. http://citeseer.ist.psu.edu/galmiche91program.html More
@misc{ galmiche91program,
author = "D. Galmiche",
title = "Program transformation by proof in constructive framework",
text = "D. Galmiche. Program transformation by proof in constructive framework.
In Informatika'91, Theoretical Computer Science and Methods of Compilation
and Program Construction, 1991.",
year = "1991",
url = "citeseer.ist.psu.edu/galmiche91program.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1987
392 A Computational Logic (context) - Boyer, Moore - 1979
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
266 Information and Computation (context) - Coquand, Huet et al. - 1988
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
96 A survey of the project automath (context) - De Bruijn - 1980
27 Synthesis of several sorting algorithms (context) - Darlington - 1978
21 Terminating general recursion (context) - Nordstrom - 1988
19 Programming with proofs : a second order type theory (context) - Parigot - 1988
18 Transformational logic program synthesis (context) - Sato, Tamaki - 1984
7 Proof transformations for equational theories (context) - Nipkow - 1990
6 Constructive system for automatic program synthesis (context) - Galmiche - 1990
6 Program development in the constructive set theory tk (context) - Henson - 1989
6 The lambda abstraction strategy for program derivation (context) - Pettorossi, Skowron - 1989
6 Normalizing the associative law - an experiment with martin-.. (context) - Hedberg - 1990
5 Inductively defined sets in martin-lof's type theory (context) - Dybjer - 1987
4 Generalization from partial parametrization in higher-order .. (context) - Hagiya - 1989
3 Automated proof and program development - Galmiche, Hermann - 1992
3 The specialization and transformation of constructive existe.. - Madden - 1989
3 The power of constructive framework for program synthesis (context) - Galmiche - 1988
2 Higher order transformations and type simulations (context) - Henson - 1988
2 Automatic guidance of program synthesis proofs (context) - Bundy - 1989
Documents on the same site (http://www.loria.fr/~galmiche/papers.html): More
SKIL: A System for Programming with Proofs - Galmiche, Hermann (1993) (Correct)
On Proof Normalization in Linear Logic - Galmiche, Perrier (1994) (Correct)
Program Development in Constructive Type Theory - Galmiche (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC