ACM SIGACT News
ACM SIGPLAN Notices
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
Sparse polynomials and linear logic
ACM SIGSAM Bulletin
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
ACM Computing Surveys (CSUR)
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Typed memory management via static capabilities
ACM Transactions on Programming Languages and Systems (TOPLAS)
On regions and linear types (extended abstract)
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Secure Information Flow via Linear Continuations
Higher-Order and Symbolic Computation
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Secure Information Flow and CPS
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Curry-Howard Isomorphism for Compilation and Program Execution
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Study of Abramsky's Linear Chemical Abstract Machine
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Resource Interpretations, Bunched Implications and the alpha lambda-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Alias Types for Recursive Data Structures
TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Gamma and the Chemical Reaction Model: Fifteen Years After
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Natural Deduction for Intuitionistic Non-communicative Linear Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A type system for bounded space and functional in-place update
Nordic Journal of Computing
Information and Computation
Evolvable concurrent processes
Computer Standards & Interfaces - Special issue: Adaptable software architectures
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
A specification logic for concurrent object-oriented programming
Mathematical Structures in Computer Science
A semantic characterisation of the correctness of a proof net
Mathematical Structures in Computer Science
Program equivalence in a linear functional language
Journal of Functional Programming
Journal of Functional Programming
Neural-symbolic intuitionistic reasoning
Design and application of hybrid intelligent systems
Theoretical Computer Science - Logic, semantics and theory of programming
Linearization of the lambda-calculus and its relation with intersection type systems
Journal of Functional Programming
Strong normalisation in the π-calculus
Information and Computation
Pattern matching as cut elimination
Theoretical Computer Science
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
Cartesian closed stable categories
Information Sciences—Informatics and Computer Science: An International Journal
CONCUR 2005 - Concurrency Theory
Intuitionistic phase semantics is almost classical
Mathematical Structures in Computer Science
Connectionist computations of intuitionistic reasoning
Theoretical Computer Science
Weak linearization of the lambda calculus
Theoretical Computer Science - Applied semantics: Selected topics
Comparing Concepts of Object Petri Net Formalisms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Resource operators for λ-calculus
Information and Computation
The Power of Closed Reduction Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
A proof theory for machine code
ACM Transactions on Programming Languages and Systems (TOPLAS)
L3: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
Coordination: Reo, Nets, and Logic
Formal Methods for Components and Objects
Plans, Actions and Dialogues Using Linear Logic
Journal of Logic, Language and Information
Science of Computer Programming
A Language For Multiplicative-additive Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
The Linear Logical Abstract Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
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
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Session types as intuitionistic linear propositions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Dependent session types via intuitionistic linear type theory
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Towards concurrent type theory
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Linear logical relations for session-based concurrency
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
L$^3$: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Comparing Concepts of Object Petri Net Formalisms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Rewriting Computation and Proof
Notions of aliasing and ownership
Aliasing in Object-Oriented Programming
On the Largest Cartesian Closed Category of Stable Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |