YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Dynamic connectors for concurrency
Theoretical Computer Science
General Recursion on Second Order Term Algebras
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Universal Interaction Systems with Only Two Agents
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Encoding linear logic with interaction combinators
Information and Computation
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
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
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Theoretical Computer Science - Special issue: Computational systems biology
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Observational Equivalence for the Interaction Combinators and Internal Separation
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Light logics and optimal reduction: Completeness and complexity
Information and Computation
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
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
Realizing monads in interaction nets via generic typed rules
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.01 |