Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Proofs and types
Linear logic and lazy computation
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Communication as fair distribution of knowledge
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
ACM SIGACT News
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of beta-reduction
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Implementing interaction nets in MONSTR
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A parallel implementation for optimal lambda-calculus reduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive
Information and Computation
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Generating Type Systems for Process Graphs
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
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
Abstract Structures for Communication between Processes
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Parallel Evaluation of Interaction Nets with MPINE
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
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A General Framework for Types in Graph Rewriting
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
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
Minimality of the correctness criterion for multiplicative proof nets
Mathematical Structures in Computer Science
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
A semantic characterisation of the correctness of a proof net
Mathematical Structures in Computer Science
Strong normalisation in the π-calculus
Information and Computation
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Pure bigraphs: structure and dynamics
Information and Computation
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
A formal model of concurrent systems based on bipartite directed acyclic graph
Science of Computer Programming - Special issue on quality system and software architectures
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Resource operators for λ-calculus
Information and Computation
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
Observational Equivalence for the Interaction Combinators and Internal Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural deduction via graphs: formal definition and computation rules
Mathematical Structures in Computer Science
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)
Intensional Properties of Polygraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Interaction Nets With Nested Pattern Matching
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-passing Nets for Functional Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Visual Programming with Interaction Nets
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine
Electronic Notes in Theoretical Computer Science (ENTCS)
A Tool for Programming with Interaction Nets
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
An Explicit Framework for Interaction Nets
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Cut-Elimination Theorem for Differential Nets with Promotion
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
LMNtal as a hierarchical logic programming language
Theoretical Computer Science
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Compilation of Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Productivity of stream definitions
Theoretical Computer Science
Encoding an Object Calculus into Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
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)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Token-Passing Nets: Call-by-Need for Free
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Journal of Visual Languages and Computing
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The separation theorem for differential interaction nets
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Confluence of pure differential nets with promotion
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Verification of graph transformation systems with context-free specifications
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Realizing impure functions in interaction nets
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
An interaction net implementation of closed reduction
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
LMNtal: a language model with links and membranes
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Call-by-name and call-by-value as token-passing interaction nets
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
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
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
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
PORGY: A Visual Graph Rewriting Environment for Complex Systems
Computer Graphics Forum
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 strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Linear Logic, Comonads And Optimal Reductions
Fundamenta Informaticae
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We propose a new kind of programming language, with the following features:a simple graph rewriting semantics,a complete symmetry between constructors and destructors,a type discipline for deterministic and deadlock-free (microscopic) parallelism.Interaction nets generalize Girard's proof nets of linear logic and illustrate the advantage of an integrated logic approach, as opposed to the external one. In other words, we did not try to design a logic describing the behaviour of some given computational system, but a programming language for which the type discipline is already (almost) a logic.In fact, we shall scarcely refer to logic, because we adopt a naïve and pragmatic style. A typical application we have in mind for this language is the design of interactive softwares such as editors or window managers.