Theoretical 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
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Parallel beta reduction is not elementary recursive
Information and Computation
Sharing Continuations: Proofnets for Languages with Explicit Control
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Parallel Evaluation of Interaction Nets with MPINE
RTA '01 Proceedings of the 12th 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
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
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
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Unique decomposition categories, Geometry of Interaction and combinatory logic
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
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
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A denotational semantics for the symmetric interaction combinators
Mathematical Structures in Computer Science
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)
Visual Programming with Interaction Nets
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Electronic Notes in Theoretical Computer Science (ENTCS)
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of 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)
Token-Passing Nets: Call-by-Need for Free
Electronic Notes in Theoretical Computer Science (ENTCS)
A token machine for full geometry of interaction
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
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
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Towards a typed geometry of interaction
Mathematical Structures in Computer Science
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
Towards a geometry of recursion
Theoretical Computer Science
A modified GoI interpretation for a linear functional programming language and its adequacy
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
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
Bottom-up β-reduction: uplinks and λ-DAGs
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
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
Towards a typed geometry of interaction
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
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
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Linear Logic, Comonads And Optimal Reductions
Fundamenta Informaticae
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Lamping discovered an optimal graph-reduction implementation of the &lgr;-calculus. Simultaneously, Girard invented the geometry of interaction, a mathematical foundation for operational semantics. In this paper, we connect and explain the geometry of interaction and Lamping's graphs. The geometry of interaction provides a suitable semantic basis for explaining and improving Lamping's system. On the other hand, graphs similar to Lamping's provide a concrete representation of the geometry of interaction. Together, they offer a new understanding of computation, as well as ideas for efficient and correct implementations.