LESCANNE, PIERRE
324  Ergebnisse:
Personensuche X
?
1

Algebraic and Logic Programming 

Proceedings of an International Workshop held in Gaussig (G...  Mathematical Research ; 49, Mathematische Forschung
Beierle, Christoph ; Bergstra, J.A ; Bockmayr, Alexander... - Reprint 2022 . , [2022]
 
?
2

Almost all Classical Theorems are Intuitionistic:

Lescanne, Pierre
RAIRO - Theoretical Informatics and Applications.  56 (2022)  - p. 9 , 2022
 
?
3

Quantitative Aspects of Linear and Affine Closed Lambda Ter..:

Lescanne, Pierre
ACM Transactions on Computational Logic (TOCL).  19 (2018)  2 - p. 1-18 , 2018
 
?
4

Combinatorics of Explicit Substitutions:

, In: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming,
 
?
5

Quantitative Aspects of Linear and Affine Closed Lambda Ter..:

Lescanne, Pierre
ACM Transactions on Computational Logic.  19 (2018)  2 - p. 1-18 , 2018
 
?
6

Combinatorics of $\lambda$-terms: a natural approach:

Bendkowski, Maciej ; Grygiel, Katarzyna ; Lescanne, Pierre.
Journal of Logic and Computation.  27 (2017)  8 - p. 2611-2630 , 2017
 
?
8

Counting and generating lambda terms:

GRYGIEL, KATARZYNA ; LESCANNE, PIERRE
Journal of Functional Programming.  23 (2013)  5 - p. 594-628 , 2013
 
?
9

On counting untyped lambda terms:

Lescanne, Pierre
Theoretical Computer Science.  474 (2013)  - p. 80-97 , 2013
 
?
11

Computation with classical sequents:

VAN BAKEL, STEFFEN ; LESCANNE, PIERRE
Mathematical Structures in Computer Science.  18 (2008)  3 - p. 555-609 , 2008
 
?
14

Addressed term rewriting systems: application to a typed ob..:

DOUGHERTY, DANIEL J. ; LESCANNE, PIERRE ; LIQUORI, LUIGI
Mathematical Structures in Computer Science.  16 (2006)  4 - p. 667 , 2006
 
?
15

Mechanizing common knowledge logic using COQ:

Lescanne, Pierre
Annals of Mathematics and Artificial Intelligence.  48 (2006)  1-2 - p. 15-43 , 2006
 
1-15
Mehr Literatur finden