Research on "Formal Methods in Computing"
|
Luca Vercelli
PhD in Mathematics
I don't work here anymore.
E-mail: luca.vercelli[at]alkeinformatica.com |
- Research interests:
- Mathematical logic
- Logic in computer science
- Set theories
- Type theories
- Linear Logic
- Implicit Computational Complexity
- CV: english, italiano
- Works (see also the official bibliography)
- Vercelli L., On the complexity of stratified logics, PhD thesis,
.pdf
- Roversi L., Vercelli L., Safe recursion on notation into a light logic, workshop DICE 2010,
.pdf, slides
- Roversi L., Vercelli L., A local criterion for polynomial time computations, workshop FOPARA 2009,
.pdf
- Gaboardi M., Roversi L., Vercelli L., A by-level analysis of Multiplicative Exponential Linear Logic, MFCS 2009,
.pdf
- Gaboardi M., Roversi L., Vercelli L., Do Light Logics allow a unified view of Stratification and Boundedness?, workshop SD@ESSLLI 2009,
.pdf,
slides (.pdf)
- Dal Lago U., Roversi L., Vercelli L., Taming Modal Impredicativity: Superlazy Reduction, LFCS 2009,
Extended abstract (.pdf), Full version (.pdf),
slides (.pdf)
- Roversi L., Vercelli L., Some Complexity and Expressiveness results on Multimodal and Stratified Proof-nets, TYPES 2008,
.pdf
- Vercelli L., 0# ed alcune sue conseguenze (italian only), degree thesis, 2006,
.pdf
- Resources
- Some photos
|
