default search action

combined dblp search
author search
venue search
publication search

ask others

Journal of Logical and Algebraic Methods in Programming, Volume 129

> Home > Journals > Journal of Logical and Algebraic Methods in Programming

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 129, November 2022

Specification and Modelling of Computing Systems through Graphs and Graph Transformation

- view
  authority control:
- export record
  dblp key:
  - journals/jlap/Pshenitsyn22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlap/Pshenitsyn22
Tikhon Pshenitsyn:
Hypergraph Lambek grammars. 100798

Interaction and Concurrency Experience 2021

- view
  authority control:
- export record
  dblp key:
  - journals/jlap/AubertV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlap/AubertV22
Clément Aubert, Daniele Varacca:
Processes against tests: On defining contextual equivalences. 100799
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jlap/LionAT22a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlap/LionAT22a
Benjamin Lion, Farhad Arbab, Carolyn L. Talcott:
A semantic model for interacting cyber-physical systems. 100807

Logic and Calculi for all, Essays Dedicated to Luís Soares Barbosa on the Occasion of His 60th Birthday

- view
  authority control:
- export record
  dblp key:
  - journals/jlap/LiuLS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlap/LiuLS22
Ai Liu, Shaoying Liu, Meng Sun:
Probabilistic mediator: A coalgebraic perspective. 100808

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.