this paper, we propose a new mechanism called calculation carrying programs that can relax the tension between efficiency and clarity in programming. The idea is to accompany clear programs with some calculation specifying our intention of how to manipulate programs to be efficient. And this calculation specification can be executed automatically by our compiler to derive efficient programs. As a result, each calculation carrying program makes itself be a complete document including a concise specification of given problem as well as an effective way to derive both efficient and correct code
Program comprehension is a very difficult task but, at the same time crucial for system maintenance ...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
Program specialization is a collection of program transformation techniques for improving program ef...
Program calculation, being a programming technique that derives programs from specification by means...
Abstract. Calculational Style of Programming, while very appealing, has several practical difficulti...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Incremental computation takes advantage of repeated computations on inputs that differ slightly fro...
Incremental computation takes advantage of repeated computations on inputs that differ slightly from...
In the late 1990s, proof-carrying code was able to produce machine-checkable safety proofs for machi...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
Abstract: Proof-carrying code approaches aim at the safe execution of untrusted code by having the c...
In calculational program design one derives implementations from specifications using semantics-pres...
Program comprehension is a very difficult task but, at the same time crucial for system maintenance ...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
Program specialization is a collection of program transformation techniques for improving program ef...
Program calculation, being a programming technique that derives programs from specification by means...
Abstract. Calculational Style of Programming, while very appealing, has several practical difficulti...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Incremental computation takes advantage of repeated computations on inputs that differ slightly fro...
Incremental computation takes advantage of repeated computations on inputs that differ slightly from...
In the late 1990s, proof-carrying code was able to produce machine-checkable safety proofs for machi...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
Abstract: Proof-carrying code approaches aim at the safe execution of untrusted code by having the c...
In calculational program design one derives implementations from specifications using semantics-pres...
Program comprehension is a very difficult task but, at the same time crucial for system maintenance ...
Non-deterministic computations greatly enhance the expressive power of functional logic programs, bu...
Program specialization is a collection of program transformation techniques for improving program ef...