Torben Amtoft  Home/Search
Context Related
| daimi.au.dk/PB/453/PB453.ps.gz 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: daimi.au.dk/doc115 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This report is a revised version of my thesis of the same title, which was accepted for the Ph.D. degree in Computer Science at University of Aarhus, Denmark, in June 1993 (Update)
Context of citations to this paper: More
.... from Torben Amtoft (Aarhus) the use of weights also oc10 curs in Amtoft s study of unfold fold transformations of logic programs [Amt93][Amt92] when the author was explaining the details of the proof of the improvement theorem. At the time, we concluded that a weighted...
Cited by: More
Higher-Order Expression Procedures - Sands (1995) (Correct)
Active bibliography (related documents): More All
2.5: Unfold/fold Transformations Preserving Termination Properties - Amtoft (1992) (Correct)
0.8: Transformation Systems and Nondeclarative Properties - Bossi, Cocco, Etalle (Correct)
0.6: Total Correctness by Local Improvement in Program Transformation - Sands (1995) (Correct)
Similar documents based on text: More All
1.5: Arbejdsanalyse - Teori og praksis - Schmidt, Carstensen (1990) (Correct)
1.5: Principper Bag Almen Beslutningsteori Illustreret Ved.. - Jørgensen (Correct)
1.4: Reasoning in the Temporal Logic of Actions - The Design and.. - Engberg (1996) (Correct)
BibTeX entry: (Update)
T. Amtoft. Sharing of computations. PhD thesis, DAIMI, Aahus University, 1993. http://citeseer.ist.psu.edu/amtoft93sharing.html More
@misc{ amtoft93sharing,
author = "T. Amtoft",
title = "Sharing of computations",
text = "T. Amtoft. Sharing of computations. PhD thesis, DAIMI, Aahus University,
1993.",
year = "1993",
url = "citeseer.ist.psu.edu/amtoft93sharing.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989 ACM
1911 Introduction to Automata Theory (context) - Hopcroft, rey et al. - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1984
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
906 A structural approach to operational semantics - Plotkin - 1981
809 A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977 ACM DBLP
347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977 DBLP
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1990 ACM DBLP
268 Proofs and Types (context) - Girard, Lafont et al. - 1989 ACM
223 The Art of Computer Programming (context) - Knuth - 1981
215 Theoretical Computer Science (context) - Raoult, rewritings - 1984
214 A fast string searching algorithm (context) - Boyer, Moore - 1977 ACM DBLP
210 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
143 A new implementation technique for applicative languages (context) - Turner - 1979
109 The Implementation of Functional Programming Languages (context) - Jones - 1987
102 Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987 ACM DBLP
98 Mix: A self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989 DBLP
96 Automatic autoprojection of recursive equations with global .. - Bondorf, Danvy - 1991 DBLP
95 On computable numbers with an application to the Entscheidun.. (context) - Turing - 1936
87 Narrowing as the operational semantics of functional languag.. (context) - Reddy - 1985
82 Algorithms for finding patterns in strings (context) - Aho - 1990
79 Graph-Grammars and Their Application to Computer Science (context) - Ehrig, Nagl et al. - 1987 ACM
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992 ACM DBLP
74 Memo' functions and machine learning (context) - Michie - 1968
72 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
72 A semantics for ML concurrency primitives - Berry, Milner et al. - 1992 ACM DBLP
64 Tabulation techniques for recursive programs (context) - Bird - 1980 ACM DBLP
62 Unfoldfold transformation logic program (context) - Tamaki, Unfold et al. - 1984
59 Lazy memo-functions (context) - Hughes - 1985
57 The concept of a supercompiler (context) - Turchin - 1986
56 A very fast substring search algorithm (context) - Sunday - 1990 ACM DBLP
47 An Automatic Partial Evaluator for Full Prolog - Sahlin - 1991
40 Algebraic properties of idempotent substitutions - Palamidessi - 1989
35 Super combinators - a new implementation method for applicat.. (context) - Hughes - 1982
34 Optimal derivations in weak lambda-calculi and in orthogonal.. - Maranget - 1991
32 ACM Transactions on Programming Languages and Systems (context) - Bossi, Cocco et al. - 1990
32 Algorithmics - The Spirit of Computing (context) - Harel - 1987
30 Unfolding - Definition - Folding (context) - Proietti, Pettorossi - 1991
29 Automatic call unfolding in a partial evaluator (context) - Sestoft - 1988
28 Needed reduction and spine strategies for the lambda calculu.. (context) - Barendregt, Kennaway et al. - 1987 ACM DBLP
26 Partial evaluation of pattern matching in constraint logic p.. (context) - Smith - 1991
25 the essence of compilation (context) - Ershov - 1978
25 Parallel Logic Programming in PARLOG - the language and its .. (context) - Gregory - 1987
24 Calculi for Time Analysis of Functional Programs (context) - Sands - 1990
24 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990 ACM DBLP
23 Semantics preserving transformation rules for Prolog (context) - Proietti, Pettorossi - 1991 ACM DBLP
19 Improving control of logic programs by using functional logi.. (context) - Hanus - 1992
19 Using types to avoid redundant specialization (context) - Ruf, Weise - 1991
19 Synthesis of eureka predicates for developing logic programs (context) - Proietti, Pettorossi - 1990
17 Unfoldfold transformation logic program (context) - Gardner, fold et al. - 1991
16 Eliminating redundant recursive calls (context) - Cohen - 1983 DBLP
16 Lucassen and David K (context) - John - 1988
16 Linear time simulation of deterministic two-way pushdown aut.. (context) - Cook - 1971 DBLP
15 Finiteness analysis (context) - Holst - 1991
13 Generalized partial computation for a lazy functional langua.. (context) - Takano - 1991
13 A program development methodology based on a unified approac.. (context) - Darlington, Pull - 1988
12 Properties of unfolding-based meta-level systems - Amtoft - 1991 ACM DBLP
11 Program transformation and rewriting - Bellegarde - 1991 ACM DBLP
11 Partial evaluation is fuller laziness (context) - Holst, Gomard - 1991 ACM DBLP
11 Generating a pattern matching compiler by partial evaluation (context) - Jrgensen - 1990
9 Blackwell Scientific Publications (context) - Henson, Functional - 1987
9 Methodologies for Transformations and Memoing in Applicative.. (context) - Pettorossi - 1984
9 Unfoldfold transformation stratified program (context) - Seki, transformation et al. - 1991
9 Rewriting techniques for program synthesis (context) - Reddy - 1989 ACM DBLP
9 Preservation stronger equivalence unfoldfold logic program t.. (context) - Kawamura, Preservation et al. - 1990
8 Unfoldfold program transformation (context) - Kott, program et al. - 1985
6 The typed lambda-calculus with firstclass processes (context) - Nielson - 1989
6 Optimal evaluations of graph-like expressions (context) - Staples - 1980 DBLP
6 Optimal reduction in weak lambda calculus with shared enviro.. (context) - Yoshida - 1993
6 A functional programming environment supporting execution (context) - Darlington, Harrison et al. - 1989
5 Semantics-based analysis and transformation of logic program.. (context) - Sndergaard - 1989
5 A note on linear time simulation of deterministic two-way pu.. (context) - Jones - 1977 DBLP
4 Strictness and binding-time analyses: Two for the price of o.. (context) - Launchbury - 1991 DBLP
4 Unfoldfold transformation preserving termination propertie - Amtoft, transformations et al. - 1992
4 Unfoldfold transformation preserving termination propertie - Amtoft, transformations et al. - 1992
4 Compiling bottom-up and mixed derivations into top-down exec.. (context) - De Schreye, Martens et al. - 1990 ACM DBLP
3 Parsers and partial evaluation: An experiment (context) - Dybkjr - 1985
2 Experiments with implementations of two theoretical construc.. (context) - Amtoft, Nikolajsen et al. - 1989
2 and Bruno Krekels (context) - Bruynooghe, De Schreye - 1989
2 A system for proving equivalences of recursive programs (context) - Kott - 1980
2 Best-first strategies for incremental transformations of log.. (context) - Proietti, Pettorossi - 1992 DBLP
2 How powerful are foldingunfolding transformation (context) - Hong, are et al. - 1991
2 or disagreement point foldunfold transformation (context) - Riis, Flemming et al. - 1990
2 uniqueness as a leitmotiv for implementation (context) - Kahrs - 1992
1 Symbolic pattern matching with intelligent backtrack (context) - Queinnec, Ge - 1991
1 Partial memoization for obtaining linear time behavior of a .. (context) - Amtoft, Tra - 1992 ACM DBLP
1 An optimal algorithm for building the Boyer-Moore automaton (context) - Cho - 1990 DBLP
1 Partial evalution of pattern matching in strings (context) - Consel, Danvy - 1989
1 Report STAN-CS (context) - Scherlis, Program et al. - 1980
1 Domaine de Voluceau Rocquencourt BP105 78153 Le Chesnay Cede.. (context) - Kott, fold et al. - 1982
1 cient algorithms for evaluating linear recurrence relations .. (context) - Pettorossi, Burstall - 1982
1 and Sandro Etalle (context) - Bossi, Cocco - 1992
1 Analysis and Reasoning about Tools: Abstracts from the Secon.. (context) - Nielson, Design - 1992
1 Another application of recursion introduction (context) - Watanabe - 1980 DBLP
1 cient implementation of the lambda-calculus (context) - Frandsen, Sturtivant et al. - 1991
1 cient memo-table management strategies (context) - Khoshnevisan - 1990
1 Term rewriting with sharing and memoization (context) - Ho - 1992
1 Memoization and its use in lazy and incremental program gene.. (context) - Amtoft, Tra - 1989
1 Call-by-mix: A reduction strategy for pure lambda-calculus (context) - Grue
1 cient formal theory (context) - Grue - 1987
1 A formal derivation of Boyer and Moore's pattern matching al.. (context) - Partsch, Stomp - 1988
Documents on the same site (http://www.daimi.au.dk/doc115.html): More
Users and computers - A contextual approach to design of computer.. - Kyng (1995) (Correct)
Modular State Space Analysis of Coloured Petri Nets - Christensen, Petrucci (1995) (Correct)
Automatic Program Specialization for Java - Schultz, Consel (2000) (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