 | 2001 |
|---|
| 11 |       | Joëlle Despeyroux,
Pierre Leleu:
Recursion over objects of functional type.
Mathematical Structures in Computer Science 11(4): 555-572 (2001) |
| 10 | | Carsten Schürmann,
Joëlle Despeyroux,
Frank Pfenning:
Primitive recursion for higher-order abstract syntax.
Theor. Comput. Sci. 266(1-2): 1-57 (2001) |
| 2000 |
|---|
| 9 | | Joëlle Despeyroux:
A Higher-Order Specification of the pi-Calculus.
IFIP TCS 2000: 425-439 |
| 8 |  | Joëlle Despeyroux,
Pierre Leleu:
Metatheoretic Results for a Modal lambda-Calculus
Journal of Functional and Logic Programming 2000(1): (2000) |
| 1998 |
|---|
| 7 | | Joëlle Despeyroux,
Pierre Leleu:
A Modal Lambda Calculus with Iteration and Case Constructs.
TYPES 1998: 47-61 |
| 1997 |
|---|
| 6 | | Joëlle Despeyroux,
Frank Pfenning,
Carsten Schürmann:
Primitive Recursion for Higher-Order Abstract Syntax.
TLCA 1997: 147-163 |
| 1995 |
|---|
| 5 | | Joëlle Despeyroux,
Amy P. Felty,
André Hirschowitz:
Higher-Order Abstract Syntax in Coq.
TLCA 1995: 124-138 |
| 1994 |
|---|
| 4 | | Joëlle Despeyroux,
André Hirschowitz:
Higher-Order Abstract Syntax with Induction in Coq.
LPAR 1994: 159-173 |
| 1992 |
|---|
| 3 | | Joëlle Despeyroux:
Theo: An Interactive Proof Development System.
BIT 32(1): 15-29 (1992) |
| 1986 |
|---|
| 2 | | Joëlle Despeyroux:
Proof of Translation in Natural Semantics
LICS 1986: 193-205 |
| 1 | | Dominique Clément,
Joëlle Despeyroux,
Th. Despeyroux,
Gilles Kahn:
A Simple Applicative Language: Mini-ML.
LISP and Functional Programming 1986: 13-27 |
Data released under the ODC-BY 1.0 license — See also our legal information page