From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
A Study of Abramsky's Linear Chemical Abstract Machine
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Categorical Models of Explicit Substitutions
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Information and Computation
On categorical equivalence of Gentzen-style derivations in IMLL
Theoretical Computer Science - Logic and complexity in computer science
Two Natural Deduction Systems for Hybrid Logic: A Comparison
Journal of Logic, Language and Information
Chu's construction: a proof-theoretic approach
Logic for concurrency and synchronisation
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Linear types and approximation
Mathematical Structures in Computer Science
Girard translation and logical predicates
Journal of Functional Programming
Program equivalence in a linear functional language
Journal of Functional Programming
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Resource operators for λ-calculus
Information and Computation
L3: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
A Language For Multiplicative-additive Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
The Linear Logical Abstract Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
Lightweight linear types in system f°
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A linear-non-linear model for a computational call-by-value lambda calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Complexity of strongly normalising λ-terms via non-idempotent intersection types
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
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
L$^3$: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |