Theoretical Computer Science
POPL '90 Proceedings of the 17th 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
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Interaction Systems II: The Practice of Optimal Reductions
Interaction Systems II: The Practice of Optimal Reductions
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
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 global dynamics of optimal graph reduction
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Call-by-Value lambda-Graph Rewriting Without Rewriting
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Geometry of synthesis: a structured approach to VLSI design
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Electronic Notes in Theoretical Computer Science (ENTCS)
A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
The Calculus of Handshake Configurations
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
A Petri Net Model of Handshake Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Supporting Function Calls within PELCR
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
Parallel implementation models for the λ-calculus using the geometry of interaction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
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
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Geometry of synthesis iv: compiling affine recursion into static hardware
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Space-Efficient computation by interaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
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
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Computation-by-Interaction with effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Abstract Machines for Game Semantics, Revisited
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We investigate implementation techniques arising directly from Girard's Geometry of Interaction semantics for Linear Logic, specifically for a simple functional programming language (PCF). This gives rise to a very simple, compact, compilation schema and run-time system. We analyse various properties of this kind of computation that suggest substantial optimisations that could make this paradigm of implementation not only practical, but potentially more efficient than extant paradigms.