John Hughes. Super combinators: A new implementation method for applicative languages. In Daniel P. Friedman and David S. Wise, editors, Programming, pages 1--10, Pittsburgh, Pennsylvania, August 1982. ACM Press. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Sharing of Computations - Amtoft (1993) (1 citation) (Correct)
Higher Order Attribute Grammars - Swierstra, Vogt (1991) (17 citations) (Correct)
On the Efficient Incremental Evaluation of Higher Order.. - Vogt, Swierstra, Kuiper (1990) (4 citations) (Correct)
An Extensional Characterization of Lambda-Lifting and.. - Danvy (1999) (4 citations) (Correct)
Higher-Order Rewriting and Partial Evaluation - Danvy, Rose (1997) (1 citation) (Correct)
Lambda-Dropping: Transforming Recursive Equations into.. - Danvy, Schultz (1999) (8 citations) (Correct)
Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
Lambda-Dropping: Transforming Recursive Equations into Programs.. - Danvy (1995) (8 citations) (Correct)
Abstract Machines for Programming Language Implementations - Diehl, Hartel, Sestoft (2000) (6 citations) (Correct)
Parallelism and Non-determinism in Pure Functional Languages - King (1992) (Correct)
Modeling Sharing and Recursion for Weak Reduction.. - Zine-El-Abidine.. (Correct)
ML-Style Typing, Lambda Lifting, and Partial Evaluation - Thiemann (1999) (Correct)
Rules and Strategies for Transforming Functional and Logic.. - Pettorossi, Proietti (1996) (51 citations) (Correct)
Higher-Order Rewriting and Partial Evaluation - Danvy, Rose (1998) (1 citation) (Correct)
Higher Order Deforestation - Hamilton (1995) (18 citations) (Correct)
The Many Disguises of Accumulation - Boiten (1991) (7 citations) (Correct)
A Parallel Functional Language Compiler for Message-Passing.. - Junaidu (1998) (1 citation) (Correct)
Optimising Partial Applications in TIM - Wakeling, Dix (1993) (Correct)
Incremental Lambda Lifting: An Exercise in.. - Sullivan, Wand (1997) (Correct)
Lambda Lifting: Transforming Programs to Recursive Equations - Johnsson (1985) (79 citations) (Correct)
Call-by-Value Combinatory Logic and the Lambda-Value Calculus - Gateley, Duba (1991) (4 citations) (Correct)
Target code generation from G-machine code - Johnsson (1986) (2 citations) (Correct)
Flexible Continuations in Logic Programs via Unfold/Fold.. - Pettorossi, Proietti (1997) (Correct)
The Call-By-Need Lambda Calculus - Ariola, Felleisen (1993) (141 citations) (Correct)
Efficient Compilation of Lazy Evaluation - Johnsson (1984) (59 citations) (Correct)
Lambda-Dropping: Transforming Recursive Equations into.. - Danvy, Schultz (1995) (8 citations) (Correct)
Optimality and Inefficiency : What Isn't a Cost Model of the.. - Lawall, Mairson (1996) (11 citations) (Correct)
Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989) (Correct)
Compilation by Transformation in Non-Strict Functional Languages - Santos (1995) (12 citations) (Correct)
A Little Goes a Long Way: A Simple Tool to Support.. - Wand, Sullivan (1995) (Correct)
Parallel Evaluation of Functional Programs: The G-machine approach - Johnsson (1991) (Correct)
An Effective Speculative Evaluation Technique for Parallel.. - Mattson, Jr. (1993) (11 citations) (Correct)
Compiling Lazy Functional Languages: An introduction - Johnsson (Correct)
Lambda-Lifting in Quadratic Time - Danvy, Schultz (2004) (1 citation) (Correct)
What is an Efficient Implementation of the λ-calculus? - Frandsen, Sturtivant (1991) (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