Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '90 1990
DOI: 10.1145/96709.96711
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for optimal lambda calculus reduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
118
0
1

Year Published

1997
1997
2014
2014

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 193 publications
(120 citation statements)
references
References 4 publications
1
118
0
1
Order By: Relevance
“…The same line of argument applies to establish the associativity of append: X = append(append( [1,3,5], [7,9]), [11,13,15]) X = append( [1,3,5],append( [7,9], [11,13,15]…”
Section: Examplementioning
confidence: 99%
See 2 more Smart Citations
“…The same line of argument applies to establish the associativity of append: X = append(append( [1,3,5], [7,9]), [11,13,15]) X = append( [1,3,5],append( [7,9], [11,13,15]…”
Section: Examplementioning
confidence: 99%
“…Most previous work in this approach adopted Interaction Nets [8] to represent and manipulate graphs ( [9][11] [12], to name a few). Many of the encodings of the λ-calculus into Interaction Nets pursued optimal sharing or efficiency, and resulted in more or less involved representation of λ-terms to achieve the objective.…”
Section: Encoding the Pure Lambda Calculus Into Hyperlmntalmentioning
confidence: 99%
See 1 more Smart Citation
“…It is a leading principle behind, among others, explicit substitution calculi [1,18,8,9,15,2], term calculi with strategies or higher-order transformations [14,3], and sharing graphs in the style of Lamping [17,4,21]. The atomic lambda-calculus represents a novel category in this range.…”
Section: Introductionmentioning
confidence: 99%
“…T h i s i s f a r from e cient i f A contains function applications that s till need to be evaluated. Some optimizations of lambdacalculus, involving sharing of a rguments by di erent functions, have b e e n p r oposed by W adsworth (1971) and Lamping (1990).…”
Section: Introductionmentioning
confidence: 99%