Interaction combinators
From MaRDI portal
Publication:1368381
DOI10.1006/inco.1997.2643zbMath0882.68058OpenAlexW2911303149MaRDI QIDQ1368381
Publication date: 28 September 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6cfe09aa6e5da6ce98077b7a048cb1badd78cc76
Related Items
Bounded combinatory logic and lower complexity ⋮ Formal molecular biology ⋮ A basic algebra of stateless connectors ⋮ The true concurrency of differential interaction nets ⋮ Operational equivalence for interaction nets. ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Variations on mobile processes ⋮ The graphical Krivine machine ⋮ Properties of co-operations: diagrammatic proofs ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Reaction graph ⋮ Soft linear logic and polynomial time ⋮ Interaction nets for linear logic ⋮ Encoding linear logic with interaction combinators ⋮ Observational Equivalence for the Interaction Combinators and Internal Separation ⋮ Universal Boolean Systems ⋮ Hard combinators ⋮ Sub-λ-calculi, Classified ⋮ Dynamic connectors for concurrency
Cites Work
