Marinus J. Plasmeijer

◀ ▶ joint publications with Hendrik Pieter Barendregt

> Home > Persons > Marinus J. Plasmeijer

Publications

1989
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/pc/BarendregtEPGKS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/BarendregtEPGKS89
Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, John R. W. Glauert, Richard Kennaway, M. Ronan Sleep:
LEAN: an intermediate language based on graph rewriting. Parallel Comput. 9(2): 163-177 (1989)
1987
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/BarendregtEPHHV87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/BarendregtEPHHV87
Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, Pieter H. Hartel, Louis O. Hertzberger, Willem G. Vree:
The Dutch parallel reduction machine project. Future Gener. Comput. Syst. 3(4): 261-270 (1987)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/parle/BarendregtEGKPS87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parle/BarendregtEGKPS87
Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep:
Term Graph Rewriting. PARLE (2) 1987: 141-158
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/parle/BarendregtEGKPS87a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parle/BarendregtEGKPS87a
Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep:
Towards an Intermediate Language based on Graph Rewriting. PARLE (2) 1987: 159-175

a service of

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.