| |
| * | 2009 | |
|---|---|---|
| 6 | EE | Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher: Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10(4): (2009) |
| 5 | EE | Emmanuel Polonowski: Deriving SN from PSN: a general proof technique CoRR abs/0909.5045: (2009) |
| 4 | EE | Tristan Crolard, Emmanuel Polonowski: A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables CoRR abs/0910.1020: (2009) |
| 2004 | ||
| 3 | EE | Emmanuel Polonowski: Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions. FoSSaCS 2004: 423-437 |
| 2003 | ||
| 2 | Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski: Proof Nets And Explicit Substitutions. Mathematical Structures in Computer Science 13(3): 409-450 (2003) | |
| 2000 | ||
| 1 | EE | Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski: Proof Nets and Explicit Substitutions. FoSSaCS 2000: 63-81 |
| 1 | Roberto Di Cosmo | [1] [2] |
| 2 | Tristan Crolard | [4] [6] |
| 3 | Delia Kesner | [1] [2] |
| 4 | Pierre Valarcher | [6] |