Program Development Schemata as Derived Rules (1998)  (Make Corrections)  
Penny Anderson, David Basin

 @ NUS   Home/Search   Context   Related

 
View or download:
informatik.unifreibur...progschema.ps
informatik.unifreiburg...ABjsc00.ps.gz
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  informatik.unifreiburg.de...pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper may be found on the web at http://www.tcnj.edu/¸penny/isalops. 1. Introduction (Update)

Similar documents (at the sentence level):
73.2%:   Program Development Schemata as Derived Rules - Anderson, Basin (1998)   (Correct)

Active bibliography (related documents):   More   All
1.8:   A Higher-Order Interpretation of Deductive Tableau - Ayari, Basin (1999)   (Correct)
0.7:   Deriving and Applying Logic Program Transformers - Anderson, Basin (1995)   (Correct)
0.7:   Formalization of the Development Process - Basin, Krieg-Brückner (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004)   (Correct)
0.1:   Related Work - Montelius (1997)   (Correct)
0.1:   Using SimICS to Evaluate the Penny System - Montelius, Magnusson (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ anderson-program,
  author = "Penny Anderson and David Basin",
  title = "Program Development Schemata as Derived Rules",
  url = "citeseer.comp.nus.edu.sg/11952.html" }
Citations (may not include all citations):
2157   Design Patterns: Elements of Reusable Object-Oriented Softwa.. (context) - Gamma, Helm et al. - 1995
505   Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
434   A framework for defining logics - Harper, Honsell et al. - 1993
204   KIDS: A semiautomatic program development system - Smith - 1990
191   Lego proof development system: User's manual (context) - Luo, Pollack - 1992
163   Application of theorem proving to problem solving (context) - Green - 1969
141   Constructive mathematics and computer programming (context) - Martin-Lof - 1982
139   fold transformations of logic programs (context) - Tamaki, Sato - 1984
137   Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
129   The foundation of a generic theorem prover - Paulson - 1989
121   Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
112   The Art of Prolog: Advanced Programming Techniques (context) - Sterling, Shapiro - 1994
97   An introduction to inductive definitions (context) - Aczel - 1977
81   The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
79   Simple consequence relations - Avron - 1991
61   Equivalences of logic programs (context) - Maher - 1987
50   Derivation of logic programs (context) - Hogger - 1981
47   A fixedpoint approach to implementing (context) - Paulson
46   The Calculus of Constructions (context) - Coquand, Huet - 1988
46   Fundamentals of the deductive program synthesis - Manna, Waldinger - 1992
39   Natural deduction as higher-order resolution - Paulson - 1985
37   Tactical theorem proving in program verification (context) - Heisel, Reif et al. - 1990
35   Specification and Transformation of Programs (context) - Partsch - 1990
35   Program Development by Specification and Transformation (context) - Hoffmann, Krieg-Bruckner - 1993
30   The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
29   A unification algorithm for typed lambda-calculus (context) - Huet - 1975
28   Logic program synthesis - Deville, Lau - 1993
28   A first order theory of data and programs (context) - Clark, Tarnlund - 1977
28   Middle-out reasoning for logic program synthesis - Kraan, Basin et al. - 1993
21   Comparative schematology (context) - Paterson, Hewitt - 1970
19   Representing logics in type theory (context) - Gardner - 1992
17   Isabelle : a generic theorem prover; with contributions by T.. (context) - Paulson
14   Foundation of logic programming based on inductive definitio.. (context) - Hagiya, Sakurai - 1984
14   Transformation of logic programs - Pettorossi, Proietti - 1998
12   Logic frameworks for logic programs - Basin - 1994
11   A framework for program development based on schematic proof - Basin, Bundy et al. - 1993
9   Generic system support for deductive program development - Ayari, Basin - 1996
9   Interactive program derivation (context) - Coen - 1992
7   Deriving and applying logic program transformers - Anderson, Basin - 1995
6   Fixpoint approach to the theory of computation (context) - Manna, Vuillemin - 1972
6   Modeling a hardware synthesis methodology in Isabelle - Basin, Friedrich - 1996
6   The Munich Project CIP (context) - Bauer - 1987
6   Logic programming (context) - Paulson, Smith - 1991
5   Using middle-out reasoning to transform naive programs into .. (context) - Hesketh, Bundy et al. - 1992
3   Syntax-directed (context) - Bibel - 1980
3   The Godel Report (context) - Hill, Lloyd - 1991
2   A survey of GLCA: A definitional approach to logic programmi.. (context) - Aronsson, Eriksson et al. - 1991
2   The equivalence of certain computations (context) - Hall - 1966
1   Formalization of the development process (context) - Basin, Krieg-Bruckner - 1998
1   Program development by stepwise refinement (context) - the, Computing et al. - 1971
1   schema-guided synthesis of logic programs (context) - th, On et al. - 1991
1   Logic programming in the LF logical framework (context) - Anderson, Pfenning - 1991
1   Specifying theorem provers in a higher-order logic programmi.. (context) - Derived, Felty et al. - 1988
1   A survey of the project Automath (context) - Languages, Amsterdam et al. - 1980
1   Logic program derivations in isabelle/hol (context) - Anderson, Basin - 1998
1   Also available from Edinburgh as DAI Research Paper (context) - Lloyd, editor et al. - 1940

Documents on the same site (http://www.informatik.uni-freiburg.de/~basin/pubs/pubs.html):   More
A Modular Presentation of Modal Logics in a Logical.. - Basin, Matthews..   (Correct)
A Recursion Planning Analysis of Inductive Completion - Barnett, Basin, Hesketh (1994)   (Correct)
A New Method for Bounding the Complexity of Modal Logics - Basin, Matthews.. (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.