Search the dblp DataBase
Pierre-Louis Curien: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Guy Cousineau, Pierre-Louis Curien, Michel Mauny
The Categorical Abstract Machine. [Citation Graph (2, 0)][DBLP]
FPCA, 1985, pp:50-64 [Conf] - Pierre-Louis Curien, Giorgio Ghelli
Coherence of Subsumption, Minimum Typing and Type-Checking in F<=. [Citation Graph (2, 0)][DBLP]
Mathematical Structures in Computer Science, 1992, v:2, n:1, pp:55-91 [Journal] - Pierre-Louis Curien
Abstract Machines, Control, and Sequents. [Citation Graph (0, 0)][DBLP]
APPSEM, 2000, pp:123-136 [Conf] - Pierre-Louis Curien, Giorgio Ghelli
Coherence of Subsumption. [Citation Graph (0, 0)][DBLP]
CAAP, 1990, pp:132-146 [Conf] - Pierre-Louis Curien, Claudia Faggian
L-Nets, Strategies and Proof-Nets. [Citation Graph (0, 0)][DBLP]
CSL, 2005, pp:167-183 [Conf] - Pierre-Louis Curien
Syntactic Equivalences Inducing Semantic Equivalences. [Citation Graph (0, 0)][DBLP]
European Conference on Computer Algebra (2), 1985, pp:168-178 [Conf] - Pierre-Louis Curien, Hugo Herbelin
Computing with Abstract Böhm Trees. [Citation Graph (0, 0)][DBLP]
Fuji International Symposium on Functional and Logic Programming, 1998, pp:20-39 [Conf] - Pierre-Louis Curien
Categorial Combinatory Logic. [Citation Graph (0, 0)][DBLP]
ICALP, 1985, pp:130-139 [Conf] - Pierre-Louis Curien, Roberto Di Cosmo
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. [Citation Graph (0, 0)][DBLP]
ICALP, 1991, pp:291-302 [Conf] - Pierre-Louis Curien, Hugo Herbelin
The duality of computation. [Citation Graph (0, 0)][DBLP]
ICFP, 2000, pp:233-243 [Conf] - Pierre-Louis Curien
Observable Algorithms on Concrete Data Structures [Citation Graph (0, 0)][DBLP]
LICS, 1992, pp:432-443 [Conf] - Guy Cousineau, Pierre-Louis Curien, Michel Mauny, Ascánder Suárez
Combinateures, Catégoriques et Implémentation des Languages Fonctionnels. [Citation Graph (0, 0)][DBLP]
Combinators and Functional Programming Languages, 1985, pp:85-103 [Conf] - Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
Strong Normalization of Substitutions. [Citation Graph (0, 0)][DBLP]
MFCS, 1992, pp:209-217 [Conf] - Pierre-Louis Curien
On the Symmetry of Sequentiality. [Citation Graph (0, 0)][DBLP]
MFPS, 1993, pp:29-71 [Conf] - Martín Abadi, Luca Cardelli, Pierre-Louis Curien
Formal Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
POPL, 1993, pp:157-170 [Conf] - Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy
Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
POPL, 1990, pp:31-46 [Conf] - Pierre-Louis Curien, Giorgio Ghelli
On Confluence for Weakly Normalizing Systems. [Citation Graph (0, 0)][DBLP]
RTA, 1991, pp:215-225 [Conf] - Pierre-Louis Curien, Giorgio Ghelli
Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=. [Citation Graph (0, 0)][DBLP]
TACS, 1991, pp:731-749 [Conf] - Pierre-Louis Curien
Typed Categorial Combinatory Logic. [Citation Graph (0, 0)][DBLP]
TAPSOFT, Vol.1, 1985, pp:157-172 [Conf] - Roberto Bellucci, Martín Abadi, Pierre-Louis Curien
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. [Citation Graph (0, 0)][DBLP]
TLCA, 1995, pp:32-46 [Conf] - Pierre-Louis Curien
Symmetry and interactivity in programming. [Citation Graph (0, 0)][DBLP]
Bulletin of Symbolic Logic, 2003, v:9, n:2, pp:169-180 [Journal] - Pierre-Louis Curien
Definability and Full Abstraction. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:301-310 [Journal] - Pierre-Louis Curien
Substitution up to Isomorphism. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1993, v:19, n:1/2, pp:51-85 [Journal] - Robert Cartwright, Pierre-Louis Curien, Matthias Felleisen
Fully Abstract Semantics for Observably Sequential Languages [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1994, v:111, n:2, pp:297-401 [Journal] - Pierre-Louis Curien
Categorical Combinators [Citation Graph (0, 0)][DBLP]
Information and Control, 1986, v:69, n:1-3, pp:188-254 [Journal] - Pierre-Louis Curien, Giorgio Ghelli
Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1994, v:109, n:1/2, pp:57-114 [Journal] - Pierre-Louis Curien, Adam Obtulowicz
Partiality, Cartesian closedness and Toposes [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:80, n:1, pp:50-95 [Journal] - Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
J. ACM, 1996, v:43, n:2, pp:362-397 [Journal] - Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy
Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 1991, v:1, n:4, pp:375-416 [Journal] - Pierre-Louis Curien, Roberto Di Cosmo
A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 1996, v:6, n:2, pp:299-327 [Journal] - Pierre-Louis Curien, Thérèse Hardin
Yet Yet a Counterexample for lambda + SP. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 1994, v:4, n:1, pp:113-115 [Journal] - Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
Strong Normalizations of Substitutions. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 1996, v:6, n:6, pp:799-817 [Journal] - Pierre-Louis Curien
Preface to Locus Solum. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 2001, v:11, n:3, pp:299-300 [Journal] - Pierre-Louis Curien
Abstract Böhm trees. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 1998, v:8, n:6, pp:559-591 [Journal] - Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli
A semantics for lambda calculi with resources. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:437-482 [Journal] - Guy Cousineau, Pierre-Louis Curien, Michel Mauny
The Categorical Abstract Machine. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1987, v:8, n:2, pp:173-202 [Journal] - Martín Abadi, Luca Cardelli, Pierre-Louis Curien
Formal Parametric Polymorphism. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1993, v:121, n:1&2, pp:9-58 [Journal] - G. Berry, Pierre-Louis Curien
Sequential Algorithms on Concrete Data Structures. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:20, n:, pp:265-321 [Journal] - Pierre-Louis Curien
Une breve biographie scientifique de Maurice Nivat. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2002, v:281, n:1-2, pp:3-23 [Journal] - Pierre-Louis Curien
An Abstract Framework for Environment Machines. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1991, v:82, n:2, pp:389-402 [Journal] - Pierre-Louis Curien, Hugo Herbelin
Abstract machines for dialogue games [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal] - Pierre-Louis Curien
Playful, streamlike computation [Citation Graph (0, 0)][DBLP]
CoRR, 2005, v:0, n:, pp:- [Journal] - Pierre-Louis Curien
Symmetry and interactivity in Programming [Citation Graph (0, 0)][DBLP]
CoRR, 2005, v:0, n:, pp:- [Journal] - Pierre-Louis Curien
Introduction to linear logic and ludics, part I [Citation Graph (0, 0)][DBLP]
CoRR, 2005, v:0, n:, pp:- [Journal] - Pierre-Louis Curien
Introduction to linear logic and ludics, part II [Citation Graph (0, 0)][DBLP]
CoRR, 2005, v:0, n:, pp:- [Journal]
Bistructures, bidomains, and linear logic. [Citation Graph (, )][DBLP]
The Joy of String Diagrams. [Citation Graph (, )][DBLP]
The duality of computation under focus [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.009secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002