David Sands  @ NUS Home/Search
Context Related
| diku.dk/diku/semantics/pa...D223.ps.gz cs.chalmers.se/~dave/papers...ep2.ps.gz Cached: PS.gz PS PDF Image Update Help From: diku.dk/researchgroups/to...1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the soundness of a specialisation technique due to Scherlis, expression procedures, in the context of a higher-order non-strict functional language. An expression procedure is a generalised procedure construct providing a contextually specialised definition. The addition of expression procedures thereby facilitates the manipulation and specialisation of programs. In the expression procedure approach, programs thus generalised are transformed by means of three key transformation... (Update)
Context of citations to this paper: More
...be used as a tool for reasoning about the running time of lazy functional programs. Improvement Theory and its Applications 11 In Sands (1990) we introduced a simple set of nave time rules, derived directly from the operational semantics. These concern equations on hei, the...
...computed in the original and the specialized programs for our PE algorithm. This is different from Scherlis [Sch81] and Sands [San95] where a specialization method for equations with complex lhs s is also defined (in the context of strict and nonstrict functional...
Cited by: More
Deriving Efficient Graph Algorithms - Reif, Scherlis (1984) (Correct)
An Intermediate Meta-Language for Program Transformation - Tullsen, Hudak (1998) (Correct)
Shifting Expression Procedures into Reverse - Tullsen, Hudak (1999) (Correct)
Similar documents (at the sentence level):
7.2%: Proving the Correctness of Recursion-Based Automatic Program.. - Sands (1995) (Correct)
Active bibliography (related documents): More All
1.9: Total Correctness by Local Improvement in Program Transformation - Sands (1995) (Correct)
0.4: Formalization of the Development Process - Basin, Krieg-Brückner (1998) (Correct)
0.3: Transformation of Logic Programs - Pettorossi, Proietti (1998) (Correct)
Similar documents based on text: More All
0.2: BTA Algorithms to Ensure Termination of Off-line Partial.. - Glenstrup, Jones (1996) (Correct)
0.2: What Not to Do When Writing an Interpreter for Specialisation - Jones (1996) (Correct)
0.2: Polyvariant Specialisation for Higher-Order, Block-Structured .. - Malmkjær, Ørbæk (1995) (Correct)
Related documents from co-citation: More All
4: Program improvement by internal specialization (context) - Scherlis - 1981
4: A transformation system for developing recursive programs - Burstall, Darlington - 1977
3: IEEE Transactions on Software Engineering (context) - Manna, Waldinger et al. - 1979
BibTeX entry: (Update)
Sands, D. (1995a). Higher-order expression procedures. In Proceeding of the ACM SIGPLAN Syposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'95, New York, pp. 190--201. ACM. http://citeseer.comp.nus.edu.sg/13817.html More
@misc{ sands-higherorder,
author = "D. Sands",
title = "Higher-order expression procedures",
text = "Sands, D. (1995a). Higher-order expression procedures. In Proceeding of
the ACM SIGPLAN Syposium on Partial Evaluation and Semantics-Based Program
Manipulation, PEPM'95, New York, pp. 190--201. ACM.",
url = "citeseer.comp.nus.edu.sg/13817.html" }
Citations (may not include all citations):385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
324 Deforestation: transforming programs to eliminate trees - Wadler - 1990
283 Theoretical Computer Science (context) - Plotkin, Call-by-value et al. - 1975
179 The lazy lambda calculus - Abramsky - 1990
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
94 Equality in lazy computation systems - Howe - 1989
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
57 The concept of a supercompiler (context) - Turchin - 1986
37 Occam's razor in metacomputation: the notion of a perfect pr.. (context) - Gluck, Klimov - 1993
27 Total correctness by local improvement in program transforma.. - Sands - 1995
18 Towards unifying partial evaluation (context) - Sorensen, Gluck et al. - 1994
17 fold transformations and loop optimization of logic programs (context) - Debray - 1988
16 Goal--directed program transformation (context) - Wegbreit - 1976
16 Transforming normal programs by replacement (context) - Bossi, Cocco et al. - 1992
13 About transformation system: A theoretical study (context) - Kott - 1978
13 Operational theories of improvement in functional languages - Sands - 1991
12 The Semantics of Destructive Lisp (context) - Mason - 1986
10 Total correctness and improvement in the transformation of f.. (context) - Sands - 1994
10 Fully abstract models of the typed -calculus (context) - Milner - 1977
7 Transformation in a non-strict language: An approach to inst.. - Runciman, Firth et al. - 1989
7 Expression Procedures and Program Derivation (context) - Scherlis - 1980
7 fold transformations preserving termination properties (context) - Amtoft - 1992
7 Turchin's supercompiler revisited: An operational theory of .. (context) - Sorensen - 1994
3 Correctness of recursion-based automatic program transformat.. (context) - Sands - 1995
2 Program improvement by internal specialisation (context) - Scherlis - 1981
2 Transactions on Programming Languages and Systems (context) - Manna, Waldinger et al. - 1979
1 Sharing of computations - Amtoft - 1993
1 A technique for transforming logic programs by fold-unfold t.. (context) - Alexandre - 1992
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1995.html): More
Combinatory Reduction Systems with Explicit Substitution - Rose (1996) (Correct)
What is a "Pointer Machine"? - Ben-Amram (1995) (Correct)
Binding-Time Analysis Applied to Mathematical Algorithms - Glück, Nakashige, Zöchling (1995) (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.