Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type fixpoints: iteration vs. recursion
Proceedings of the fourth 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
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Parallel beta reduction is not elementary recursive
Information and Computation
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
Relating conflict-free stable transition and event models via redex families
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
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
Call-by-Value lambda-Graph Rewriting Without Rewriting
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Phase semantics and decidability of elementary affine logic
Theoretical Computer Science - Logic, semantics and theory of programming
(Optimal) duplication is not elementary recursive
Information and Computation
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
Resource operators for λ-calculus
Information and Computation
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural deduction via graphs: formal definition and computation rules
Mathematical Structures in Computer Science
Plugging a Space Leak with an Arrow
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-Order and Symbolic Computation
Complete Laziness: a Natural Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-passing Nets for Functional Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
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)
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Deciding monadic theories of hyperalgebraic trees
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
Jumping boxes: representing lambda-calculus boxes by jumps
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Optimality for dynamic patterns
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A sequent calculus with implicit term representation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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
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
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
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Sharing in the weak lambda-calculus
Processes, Terms and Cycles
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Linear dependent types in a call-by-value scenario
Proceedings of the 14th symposium on Principles and practice of declarative 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
| Hi-index | 0.00 |