Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive
Information and Computation
Theoretical Computer Science
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
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Quadratic Correctness Criterion for Non-commutative Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
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
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th 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
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Implicit exchange in multiplicative proofnets
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Minimality of the correctness criterion for multiplicative proof nets
Mathematical Structures in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science - Logic, language, information and computation
Resource operators for λ-calculus
Information and Computation
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
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)
Rewritings for Polarized Multiplicative and Exponential Proof Structures
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
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof-search in implicative linear logic as a matching problem
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Retractile proof nets of the purely multiplicative and additive fragment of linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
A linear algorithm for MLL proof net correctness and sequentialization
Theoretical Computer Science
Correctness of linear logic proof structures is NL-complete
Theoretical Computer Science
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Correctness of multiplicative (and exponential) proof structures is NL-complete
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |