2013
A bit of history on program transformation fib(0) = a fib(1) = b fib(n+2) = fib(n+1) + fib(n)- Burstall-Darlington (1977) transformation of functional programs- Tamaki-Sato (1984) transformation of logic programs- Etalle-Gabbrielli (1996) transformation of constraint logic programs Transformation: from correct specifications to efficient implementations fib(n) = a where <a,b>=r(n) r(0) = <a,b> r(2n) = <u2+2uv, u2+v2> r(2n+1) = <(u+v)2+u2, u2+2uv> where <u,v>=r(n) 1. ‘improving’ 2. ‘proving ’ (this talk) ∀i,j 0!i<j!n → A[i] ! A[j] merge-sort quick-sort
Cited by 0
Sieg, Wilfried, Wainer, Stanley S. · KiltHub Repository · 2018
Wilfred Sieg and Stanley S. Wainer. Program Transformation and Proof Transformation.
Cited by 0Open access
Sieg, Wainer, S. S. · KiltHub Repository · 2018
Abstract: "A 'linear-style' sequent calculus makes it possible to explore the close structural relationships between primitive recursive programs and their inductive termination proofs, and between program transformations and their corresponding proof transformations. In this context the recursive-to-tail-recursive transformation corresponds proof theoretically to a certain kind of cut elimination, called here 'call by value cut elimination'."
Cited by 0Open access
Sieg, Wilfried, Wainer, Stanley S. · KiltHub Repository · 2018
Wilfred Sieg and Stanley S. Wainer. Program Transformation and Proof Transformation.
Cited by 0Open access
Maoteng Zheng, Zhu Tang · 1985
This paper presents a new semantic description grammar——thetransformation grammar. This transformation grammar can be used to describe the formal transformation between programming languages. According to this transformation grammar, a program transformation algorithm can transform source language programs into object language programs.
Cited by 0
Alberto Pettorossi, Maurizio Proietti · EPiC series in computing · 2018
We present a transformational approach to program verification and software model checking that uses three main ingredients: (i) Constraint Logic Programming (CLP), (ii) metaprogramming and program specialization, and (iii) proof by transformation.
Cited by 0Open access
J. Herbert Waite, Sheldon M. Epstein, Otto Koudelka · Defense Technical Information Center (DTIC) · 1975
This report discusses a computer software package that has been developed by the EDS and R Project for preparing a standard binary coded microfilm for input to a wide variety of computer output microfilm (COM) devices. This software package is currently being tested at Picatinny Arsenal on two different data base applications prior to being released to other Army installations. (Author)
Cited by 0
Mats Larsson · Palgrave Macmillan UK eBooks · 2009
The energy systems transformation cannot be achieved without a certain amount of overall planning. The most important reason for this is the speed with which we probably need to transform energy systems, in order to avoid climate disaster and oil shortfalls. Most probably, we do not have the time to wait for the market mechanisms to slowly deliver results. At some point in the near future, we will discover that we need to speed up the process, and run the program as a planned transformation effort. At this point, we will need to rapidly get our act together and make a number of decisions related to the strategy and planning of the program.KeywordsWind TurbineWind PowerEnergy TransformationTransformation ProgramPhotovoltaic PowerThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 2
Digital Commons - USU (Utah State University) · 2010
Cited by 0
Oege de Moor, Ganesh Sittampalam · 1998
Cited by 9
Michael Herschenfeld · 2018
Transformation Zone Program The Transformation Zone Program is to assist districts and other local educational leaders to plan and design a Transformation Zone (TZ). Transformation Zones group multiple campuses that are low-performing together and provide these campuses with autonomy over people, time, mo
Cited by 0
Hiroshi Hoshino, Masahiro Esashi, Kiyoshi Agusa et al. · Lecture notes in control and information sciences · 2006
Cited by 1
John Launchbury, Sava Krstić, Timothy E. Sauerwein · 2000
Abstract : Automatic removal of intermediate structures has been an exciting possibility for a long time, holding a promise of the best of two worlds: programming with explicit intermediate structures enables concise and modular solution to problems; and the removal of the structures provides efficient run-time implementations. One particularly effective technique is called the fold-build rule. The rule exploits a convergence of three programming aspects, structured iteration, function abstraction, and parametricity, to achieve intermediate structure removal in a single transformation step. One shortcoming of the technique is that, up to now, it has not been clear how to fuse zip. The purpose of this paper is to extend the fold-build technique, showing how both branches of zip can be fused concurrently. The paper is organized as follows. We review the fold-build technique, then we introduce a new form of fold that enables coroutining, and show how this provides a solution to the zip problem. Then we present alternative models for coroutining folds, discuss implementation, and demonstrate full fusion. Finally, we give axiomatization for an abstract type that unifies the various models and we initiate a study of the abstract type that we hope will lead to a proof of correctness of the new fusion algorithm.
Cited by 0
Ran Ji, Richard Bubel · Lecture notes in computer science · 2016
Cited by 2
George Krasadakis · 2020
Cited by 0
World Bank · RePEc: Research Papers in Economics · 2014
The proposed Health Transformation \n Program objective is to reduce key risks for \n non-communicable diseases, improve financial protection and \n enhance efficiency of health services in Moldova. The \n proposed four-year (2014-2018) Health Transformation Program \n will support a subset of the Strategy s first three \n sections. The proposed Program-for-Results (PforR) covers a \n time slice of a portion of the GOM program. It is expected \n to contribute to the Government program and, therefore, \n health system as a whole, by disbursing funds against \n achievement of a subset of its key results.
Cited by 0Open access
Markus Mottl · 2000
We present a framework for automatic program transformation of a strict and pure functional language with a well-defined semantics. It will be shown that such a framework can be implemented most declaratively and concisely in a recently developed higher-order logic programming language called LambdaProlog. The most important component of this framework is an efficient, always terminating partial evaluator that can handle higher-order functions and preserves the effect behaviour of programs by making use of monads, a construct which originated in category theory. This allows us to fully exploit the higher-order capabilities of the implementation language to reason about computations as required for partial evaluation. Due to this technique, the only factor that limits the optimisation power of the partial evaluator seems to be the generally undecidable problem of inferring termination behaviour of computations.
Cited by 0
Victor Winter · University of North Texas Digital Library (University of North Texas) · 1999
HATS is a general purpose syntax derivation tree based transformation system in which transformation sequences are described in special purpose language. A powerful feature of this language is that unification is an explicit operation. By making unification explicit, an elegant framework arises in which to express complex application conditions which in turn enables refined control strategies to be realized. This paper gives an overview of HATS, focusing especially on the framework provided by the transformation language and its potential with respect to control and general purpose transformation.
Cited by 9Open access
Douglas C. Comer · 2024
Cited by 0
Bellegarde · 1990
Cited by 0