• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Sharing of Computations (1993)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.daimi.au.dk]
  • [people.cis.ksu.edu]
  • [www.cis.ksu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Torben Amtoft
Citations:14 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Amtoft93sharingof,
    author = {Torben Amtoft},
    title = {Sharing of Computations},
    year = {1993}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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

Citations

3376 Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
2970 Communication and Concurrency - Milner - 1989
1739 Foundations of logic programming - Lloyd
1182 A structural approach to operational semantics - Plotkin - 1981
996 The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984
914 On computable numbers, with an application to the Entscheidungsproblem - Turing - 1936
585 The Art of Prolog - Sterling, Shapiro - 1986
533 A transformation system for developing recursive programs - Burstall, Darlington - 1977
515 The Implementation of Functional Programming Languages - Jones - 1987
487 A fast string searching algorithm - Boyer, Moore - 1977
375 Deforestation: Transforming programs to eliminate trees - Wadler - 1990
325 Proofs and Types - Girard, Lafont, et al. - 1989
178 A new implementation technique for applicative languages - Turner - 1979
114 Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming 16 - Bondorf, Danvy - 1991
113 ILSoudergaard MIX: a self-applicable partial evaluator for experiments in compiler generation - Jones - 1989
112 Algorithms for finding patterns in strings - Aho - 1990
107 An algorithm for optimal lambda calculus reduction - Lamping - 1990
105 Semantics and Pragmatics of the Lambda Calculus - Wadsworth - 1971
100 Narrowing as the Operational Semantics of Functional Languages - Reddy - 1985
98 A very fast substring search algorithm - Sunday - 1990
89 Term graph rewriting - Barendregt, Eekelen, et al. - 1987
83 Memo functions and machine learning - Michie - 1968
80 A semantics for ML concurrency primitives - Berry, Milner, et al. - 1992
74 Algorithmics: The Spirit of Computing - Harel - 1987
66 Tabulation techniques for recursive programs - Bird - 1980
50 Lazy memo-functions - Hughes - 1985
42 Algebraic properties of idempotent substitutions - Palamidessi
40 Parallel Logic Programming in PARLOG: The Language and its Implementation - Gregory - 1987
35 Unfold/fold transformations in logic programs - Gardner, Shepherdson - 1991
32 Compiling Control - Bruynooghe, Schreye, et al. - 1989
31 Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems - Maranget
30 Polymorphic eect systems - Lucassen, Giord - 1988
29 A method of specializing logic programs - Bossi, Cocco, et al. - 1990
28 Improving control of logic programs by using functional logic languages - Hanus - 1992
28 Using Types to Avoid Redundant Specialization - Ruf, Weise - 1991
26 On Graph Rewritings - Raoult - 1984
24 On the essence of compilation - Ershov - 1978
21 Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages - Smith - 1991
20 Semantics preserving transformation rules for Prolog - Proietti, Pettorossi - 1991
17 The typed lambda-calculus with first-class processes - Nielson - 1989
17 Unfolding – definition – folding, in this order, for avoiding unnecessary variables in logic programs - Proietti, Pettorossi - 1995
17 Expression Procedures and Program Derivation - SCHERLIS - 1980
14 Linear time simulation of deterministic two-way pushdown automata - Cook - 1972
14 Unfold/fold program transformation - Kott - 1985
12 On safe folding - Bossi, Cocco, et al. - 1992
12 A functional programming environment supporting execution, partial execution and transformation - Darlington, Harrison, et al. - 1989
11 A program development methodology based on a unified approach to execution and transformation - Darlington, Pull - 1988
10 combinators: A new implementation method for applicative languages - Super - 1982
9 Properties of Unfolding-based Meta-level Systems - Amtoft - 1991
9 Unfold/fold transformations preserving termination properties - Amtoft - 1992
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University