| 2012 | ||
|---|---|---|
| 58 | Pierre-Louis Curien, Claudia Faggian: An approach to innocent strategies as graphs. Inf. Comput. 214: 119-155 (2012) | |
| 2011 | ||
| 57 | Pierre-Louis Curien: Preface. Theor. Comput. Sci. 412(20): 1853-1859 (2011) | |
| 2010 | ||
| 56 | Pierre-Louis Curien, Guillaume Munch-Maccagnoni: The Duality of Computation under Focus. IFIP TCS 2010: 165-181 | |
| 55 | Pierre-Louis Curien, Guillaume Munch-Maccagnoni: The duality of computation under focus CoRR abs/1006.2283: (2010) | |
| 2009 | ||
| 54 | Pierre-Louis Curien: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings Springer 2009 | |
| 53 | Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeff Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker, Steve Zdancewic: An overview of the Oregon programming languages summer school. SIGPLAN Notices 44(11): 1-3 (2009) | |
| 2008 | ||
| 52 | Pierre-Louis Curien: The Joy of String Diagrams. CSL 2008: 15-22 | |
| 51 | Pierre-Louis Curien, Vincent Danos, Jean Krivine, Min Zhang: Computational self-assembly. Theor. Comput. Sci. 404(1-2): 61-75 (2008) | |
| 2007 | ||
| 50 | Pierre-Louis Curien, Hugo Herbelin: Abstract machines for dialogue games CoRR abs/0706.2544: (2007) | |
| 49 | Pierre-Louis Curien: Definability and Full Abstraction. Electr. Notes Theor. Comput. Sci. 172: 301-310 (2007) | |
| 2005 | ||
| 48 | Pierre-Louis Curien, Claudia Faggian: L-Nets, Strategies and Proof-Nets. CSL 2005: 167-183 | |
| 47 | Pierre-Louis Curien: Playful, streamlike computation CoRR abs/cs/0501033: (2005) | |
| 46 | Pierre-Louis Curien: Symmetry and interactivity in Programming CoRR abs/cs/0501034: (2005) | |
| 45 | Pierre-Louis Curien: Introduction to linear logic and ludics, part I CoRR abs/cs/0501035: (2005) | |
| 44 | Pierre-Louis Curien: Introduction to linear logic and ludics, part II CoRR abs/cs/0501039: (2005) | |
| 2003 | ||
| 43 | Pierre-Louis Curien: Symmetry and interactivity in programming. Bulletin of Symbolic Logic 9(2): 169-180 (2003) | |
| 2002 | ||
| 42 | Pierre-Louis Curien: Une breve biographie scientifique de Maurice Nivat. Theor. Comput. Sci. 281(1-2): 3-23 (2002) | |
| 2001 | ||
| 41 | Pierre-Louis Curien: Preface to Locus Solum. Mathematical Structures in Computer Science 11(3): 299-300 (2001) | |
| 2000 | ||
| 40 | Pierre-Louis Curien: Abstract Machines, Control, and Sequents. APPSEM 2000: 123-136 | |
| 39 | Pierre-Louis Curien, Hugo Herbelin: The duality of computation. ICFP 2000: 233-243 | |
| 38 | Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel: Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54 | |
| 1999 | ||
| 37 | Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli: A semantics for lambda calculi with resources. Mathematical Structures in Computer Science 9(4): 437-482 (1999) | |
| 1998 | ||
| 36 | Pierre-Louis Curien, Hugo Herbelin: Computing with Abstract Böhm Trees. Fuji International Symposium on Functional and Logic Programming 1998: 20-39 | |
| 35 | Pierre-Louis Curien, Matthew Hennessy, Huimin Lin: Preface. J. Comput. Sci. Technol. 13(6): 481 (1998) | |
| 34 | Pierre-Louis Curien: Explicit substitutions: A short survey. J. Comput. Sci. Technol. 13(6): 562-563 (1998) | |
| 33 | Pierre-Louis Curien: Abstract Böhm trees. Mathematical Structures in Computer Science 8(6): 559-591 (1998) | |
| 1996 | ||
| 32 | Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy: Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM 43(2): 362-397 (1996) | |
| 31 | Pierre-Louis Curien, Roberto Di Cosmo: A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object. J. Funct. Program. 6(2): 299-327 (1996) | |
| 30 | Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos: Strong Normalizations of Substitutions. J. Log. Comput. 6(6): 799-817 (1996) | |
| 1995 | ||
| 29 | Roberto Bellucci, Martín Abadi, Pierre-Louis Curien: A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. TLCA 1995: 32-46 | |
| 1994 | ||
| 28 | Pierre-Louis Curien, Giorgio Ghelli: Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le Inf. Comput. 109(1/2): 57-114 (1994) | |
| 27 | Robert Cartwright, Pierre-Louis Curien, Matthias Felleisen: Fully Abstract Semantics for Observably Sequential Languages Inf. Comput. 111(2): 297-401 (1994) | |
| 26 | Pierre-Louis Curien, Thérèse Hardin: Yet Yet a Counterexample for lambda + SP. J. Funct. Program. 4(1): 113-115 (1994) | |
| 1993 | ||
| 25 | Pierre-Louis Curien: On the Symmetry of Sequentiality. MFPS 1993: 29-71 | |
| 24 | Martín Abadi, Luca Cardelli, Pierre-Louis Curien: Formal Parametric Polymorphism. POPL 1993: 157-170 | |
| 23 | Pierre-Louis Curien: Substitution up to Isomorphism. Fundam. Inform. 19(1/2): 51-85 (1993) | |
| 22 | Martín Abadi, Luca Cardelli, Pierre-Louis Curien: Formal Parametric Polymorphism. Theor. Comput. Sci. 121(1&2): 9-58 (1993) | |
| 1992 | ||
| 21 | Pierre-Louis Curien: Observable Algorithms on Concrete Data Structures LICS 1992: 432-443 | |
| 20 | Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos: Strong Normalization of Substitutions. MFCS 1992: 209-217 | |
| 19 | Pierre-Louis Curien, Giorgio Ghelli: Coherence of Subsumption, Minimum Typing and Type-Checking in F<=. Mathematical Structures in Computer Science 2(1): 55-91 (1992) | |
| 1991 | ||
| 18 | David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard: Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings Springer 1991 | |
| 17 | Pierre-Louis Curien, Roberto Di Cosmo: A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. ICALP 1991: 291-302 | |
| 16 | Pierre-Louis Curien, Giorgio Ghelli: On Confluence for Weakly Normalizing Systems. RTA 1991: 215-225 | |
| 15 | Pierre-Louis Curien, Giorgio Ghelli: Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=. TACS 1991: 731-749 | |
| 14 | Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy: Explicit Substitutions. J. Funct. Program. 1(4): 375-416 (1991) | |
| 13 | Pierre-Louis Curien: An Abstract Framework for Environment Machines. Theor. Comput. Sci. 82(2): 389-402 (1991) | |
| 1990 | ||
| 12 | Pierre-Louis Curien, Giorgio Ghelli: Coherence of Subsumption. CAAP 1990: 132-146 | |
| 11 | Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy: Explicit Substitutions. POPL 1990: 31-46 | |
| 1989 | ||
| 10 | Pierre-Louis Curien, Adam Obtulowicz: Partiality, Cartesian closedness and Toposes Inf. Comput. 80(1): 50-95 (1989) | |
| 1987 | ||
| 9 | Guy Cousineau, Pierre-Louis Curien, Michel Mauny: The Categorical Abstract Machine. Sci. Comput. Program. 8(2): 173-202 (1987) | |
| 1986 | ||
| 8 | Guy Cousineau, Pierre-Louis Curien, Bernard Robinet: Combinators and Functional Programming Languages, Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985, Proceedings Springer 1986 | |
| 7 | Pierre-Louis Curien: Categorical Combinators Information and Control 69(1-3): 188-254 (1986) | |
| 1985 | ||
| 6 | Guy Cousineau, Pierre-Louis Curien, Michel Mauny, Ascánder Suárez: Combinateures, Catégoriques et Implémentation des Languages Fonctionnels. Combinators and Functional Programming Languages 1985: 85-103 | |
| 5 | Pierre-Louis Curien: Syntactic Equivalences Inducing Semantic Equivalences. European Conference on Computer Algebra (2) 1985: 168-178 | |
| 4 | Guy Cousineau, Pierre-Louis Curien, Michel Mauny: The Categorical Abstract Machine. FPCA 1985: 50-64 | |
| 3 | Pierre-Louis Curien: Categorial Combinatory Logic. ICALP 1985: 130-139 | |
| 2 | Pierre-Louis Curien: Typed Categorial Combinatory Logic. TAPSOFT, Vol.1 1985: 157-172 | |
| 1982 | ||
| 1 | G. Berry, Pierre-Louis Curien: Sequential Algorithms on Concrete Data Structures. Theor. Comput. Sci. 20: 265-321 (1982) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page