Horatiu Cirstea

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 Germain Faure

> Home > Persons > Horatiu Cirstea

Publications

2007
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/lisp/CirsteaFK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lisp/CirsteaFK07
Horatiu Cirstea, Germain Faure, Claude Kirchner:
A rho-calculus of explicit constraint application. High. Order Symb. Comput. 20(1-2): 37-72 (2007)
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/rta/CirsteaF07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rta/CirsteaF07
Horatiu Cirstea, Germain Faure:
Confluence of Pattern-Based Calculi. RTA 2007: 78-92
2006
[c17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/CirsteaFFMS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/CirsteaFFMS07
Horatiu Cirstea, Germain Faure, Maribel Fernández, Ian Mackie, François-Régis Sinot:
From Functional Programs to Interaction Nets via the Rewriting Calculus. WRS@FLoC 2006: 39-56
2004
[c13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/CirsteaFK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/CirsteaFK05
Horatiu Cirstea, Germain Faure, Claude Kirchner:
A rho-Calculus of Explicit Constraint Application. WRLA 2004: 51-67

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.