Two-level expression representation for faster evaluation
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Optimal reduction in weak-&lgr;-calculus with shared environments
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Optimality and inefficiency: what isn't a cost model of the lambda calculus?
Proceedings of the first ACM SIGPLAN international conference on Functional programming
On the complexity of beta-reduction
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On global dynamics of optimal graph reduction
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
(Optimal) duplication is not elementary recursive
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A parallel implementation for optimal lambda-calculus reduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
From checking to inference via driving and dag grammars
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Parallel beta reduction is not elementary recursive
Information and Computation
Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
Sharing Continuations: Proofnets for Languages with Explicit Control
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
The Metalanguage lambda-Prolog and Its Implementation
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Scheduling vs Communication in PELCR
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Sequential and Concurrent Abstract Machines for Interaction Nets
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Proof Nets and Explicit Substitutions
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Proofnets and Context Semantics for the Additives
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Universal Interaction Systems with Only Two Agents
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Coherence for sharing proof-nets
Theoretical Computer Science - Linear logic
Encoding linear logic with interaction combinators
Information and Computation
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
The call-by-need lambda calculus
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
(Optimal) duplication is not elementary recursive
Information and Computation
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
The conflict-free reduction geometry
Theoretical Computer Science
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
Plugging a Space Leak with an Arrow
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-Order and Symbolic Computation
Strongly reducing variants of the Krivine abstract machine
Higher-Order and Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Interaction Nets With Nested Pattern Matching
Electronic Notes in Theoretical Computer Science (ENTCS)
Complete Laziness: a Natural Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Minimality in a Linear Calculus with Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
The weak lambda calculus as a reasonable machine
Theoretical Computer Science
Efficient memory representation of XML document trees
Information Systems
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding an Object Calculus into Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Sharing Implementations of Graph Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Programming Language for Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Supporting Function Calls within PELCR
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-Passing Nets: Call-by-Need for Free
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Visual Languages and Computing
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
The complexity of β-reduction in low orders
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Efficient reductions with director strings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Principal typing in elementary affine logic
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
From proof-nets to linear logic type systems for polynomial time computing
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Bottom-up β-reduction: Uplinks and λ-DAGs
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Light logics and optimal reduction: Completeness and complexity
Information and Computation
Theoretical Computer Science
A prismoid framework for languages with resources
Theoretical Computer Science
An interaction net implementation of closed reduction
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
An invariant cost model for the lambda calculus
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
A unified approach to fully lazy sharing
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bottom-up β-reduction: uplinks and λ-DAGs
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Call-by-name and call-by-value as token-passing interaction nets
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Sharing in the weak lambda-calculus
Processes, Terms and Cycles
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Sharing in the graph rewriting calculus
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
Full abstraction for set-based models of the symmetric interaction combinators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Linear dependent types in a call-by-value scenario
Proceedings of the 14th symposium on Principles and practice of declarative programming
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Linear Logic, Comonads And Optimal Reductions
Fundamenta Informaticae
Weak optimality, and the meaning of sharing
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
The Cost of Usage in the ?-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We present an algorithm for lambda expression reduction that avoids any copying that could later cause duplication of work. It is optimal in the sense defined by Lévy. The basis of the algorithm is a graphical representation of the kinds of commonality that can arise from substitutions; the idea can be adapted to represent other kinds of expressions besides lambda expressions. The algorithm is also well suited to parallel implementations, consisting of a fixed set of local graph rewrite rules.