Foto del docente

Simone Martini

Full Professor

Department of Computer Science and Engineering

Academic discipline: INF/01 Informatics

Publications

U. Dal Lago; S. Martini, Proofs as efficient programs, in: Deduction, Computation, Experiment, HEIDELBERG - BERLIN, Springer Verlag, 2008, pp. 141 - 157 [Chapter or essay]

U. Dal Lago; S. Martini, The weak lambda-calculus as a reasonable machine, «THEORETICAL COMPUTER SCIENCE», 2008, 398, pp. 32 - 50 [Scientific article]

DAL LAGO, Ugo; Martini, Simone, An invariant cost model for the lambda calculus, in: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, BERLIN, Springer Verlag, 2006, LNCS 3988, pp. 105 - 114 (atti di: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, 30 June - 5 July, 2006) [Contribution to conference proceedings]

P. Coppola; S. Martini, Optimizing optimal reduction. A type inference algorithm for elementary affine logic, «ACM TRANSACTIONS ON COMPUTATIONAL LOGIC», 2006, 7, pp. 219 - 260 [Scientific article]

P. Salomoni; L. Donatiello; S. Martini; N. Parisini; M. Roccetti; F. Vitali, Generazione Automatica di Learning Objects Accessibili a Partire da Documenti: il Sistema di Produzione di A3, in: ATTI XLIII Congresso Annuale AICA, UDINE, AICA, 2005(atti di: XLIII Congresso Annuale AICA, Udine, 5-7 Ottobre 2005) [Contribution to conference proceedings]

U. DAL LAGO; S. MARTINI; L. ROVERSI, Higher order linear ramified recurrence, in: Types for Proofs and Programs, BERLIN, HEIDELBERG, Spinger, 2004, 3085, pp. 178 - 193 (atti di: International Workshop, TYPES 2003. Revised Selected Papers, Torino, Italy, April 30 - May 4, 2003) [Contribution to conference proceedings]

A. Asperti; P.Coppola; S.Martini., (Optimal) duplication is not elementary recursive., «INFORMATION AND COMPUTATION», 2004, 193(1), pp. 21 - 56 [Scientific article]

MARTINI S.; DAL LAGO U., Phase Semantics and Decidability of Elementary Affine Logic, «THEORETICAL COMPUTER SCIENCE», 2004, 318(3), pp. 409 - 433 [Scientific article]

S. Martini, Provando e riprovando, in: P. COPPOLA S. MIZZARO, Laboratorio di programmazione in Java, MILANO, Apogeo, 2004, pp. ix - x [Brief introduction]

Martini S., Bounded quantifiers have Interval Models, in: Proceedings of the 1988 ACM Conference on LISP and Functional Programming, LFP 1988, Association for Computing Machinery, Inc, 1988, pp. 164 - 173 (atti di: 1988 ACM Conference on LISP and Functional Programming, LFP 1988, usa, 1988) [Contribution to conference proceedings]