|
Search the dblp DataBase
Joëlle Despeyroux:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Joëlle Despeyroux
A Higher-Order Specification of the pi-Calculus. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2000, pp:425-439 [Conf]
- Dominique Clément, Joëlle Despeyroux, Th. Despeyroux, Gilles Kahn
A Simple Applicative Language: Mini-ML. [Citation Graph (0, 0)][DBLP] LISP and Functional Programming, 1986, pp:13-27 [Conf]
- Joëlle Despeyroux
Proof of Translation in Natural Semantics [Citation Graph (0, 0)][DBLP] LICS, 1986, pp:193-205 [Conf]
- Joëlle Despeyroux, André Hirschowitz
Higher-Order Abstract Syntax with Induction in Coq. [Citation Graph (0, 0)][DBLP] LPAR, 1994, pp:159-173 [Conf]
- Joëlle Despeyroux, Amy P. Felty, André Hirschowitz
Higher-Order Abstract Syntax in Coq. [Citation Graph (0, 0)][DBLP] TLCA, 1995, pp:124-138 [Conf]
- Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann
Primitive Recursion for Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP] TLCA, 1997, pp:147-163 [Conf]
- Joëlle Despeyroux, Pierre Leleu
A Modal Lambda Calculus with Iteration and Case Constructs. [Citation Graph (0, 0)][DBLP] TYPES, 1998, pp:47-61 [Conf]
- Joëlle Despeyroux
Theo: An Interactive Proof Development System. [Citation Graph (0, 0)][DBLP] BIT, 1992, v:32, n:1, pp:15-29 [Journal]
- Joëlle Despeyroux, Pierre Leleu
Metatheoretic Results for a Modal lambda-Calculus [Citation Graph (0, 0)][DBLP] Journal of Functional and Logic Programming, 2000, v:2000, n:1, pp:- [Journal]
- Joëlle Despeyroux, Pierre Leleu
Recursion over objects of functional type. [Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 2001, v:11, n:4, pp:555-572 [Journal]
- Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning
Primitive recursion for higher-order abstract syntax. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:266, n:1-2, pp:1-57 [Journal]
Search in 0.002secs, Finished in 0.003secs
|