Janis Iraids

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Audris Kalnins

> Home > Persons > Janis Iraids

Publications

2012
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/sofsem/KalninaKSCI12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/KalninaKSCI12
Elina Kalnina, Audris Kalnins, Agris Sostaks, Edgars Celms, Janis Iraids:
Tree Based Domain-Specific Mapping Languages. SOFSEM 2012: 492-504
2011
[c3]
- view
  authority control:
- export record
  dblp key:
  - journals/corr/abs-1111-4750
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1111-4750
Agris Sostaks, Elina Kalnina, Audris Kalnins, Edgars Celms, Janis Iraids:
Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations. TTC 2011: 159-167
[c2]
- view
  authority control:
- export record
  dblp key:
  - journals/corr/abs-1111-4755
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1111-4755
Elina Kalnina, Audris Kalnins, Agris Sostaks, Janis Iraids, Edgars Celms:
Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case. TTC 2011: 237-252
2010
[c1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/enase/KalninaKCSI10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/enase/KalninaKCSI10
Elina Kalnina, Audris Kalnins, Edgars Celms, Agris Sostaks, Janis Iraids:
Generation Mechanisms in Graphical Template Language. MDA/MTDD 2010: 43-52

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.