Simone Martini

Ugo Dal Lago, Simone Martini: On Constructor Rewrite Systems and the Lambda Calculus. Logical Methods in Computer Science 8(3) (2012)

Simone Martini, Adriano Fagiolini, Laura Giarré, Antonio Bicchi: Identification of distributed systems with logical interaction structure. CDC 2012: 5228-5233

Simone Martini, Adriano Fagiolini, Giancarlo Zichittella, Magnus Egerstedt, Antonio Bicchi: Decentralized classification in societies of autonomous and heterogenous robots. ICRA 2011: 32-39

Michael Kaminski, Simone Martini: CSL 2008 special issue. ACM Trans. Comput. Log. 11(4) (2010)

Mauro Franceschelli, Simone Martini, Magnus Egerstedt, Antonio Bicchi, Alessandro Giua: Observability and controllability verification in multi-agent systems through decentralized Laplacian spectrum estimation. CDC 2010: 5775-5780

Philip Twu, Magnus Egerstedt, Simone Martini: Controllability of homogeneous single-leader networks. CDC 2010: 5869-5874

Adriano Fagiolini, Simone Martini, Davide Di Baccio, Antonio Bicchi: A self-routing protocol for distributed consensus on logical information. IROS 2010: 5151-5156

Ugo Dal Lago, Simone Martini, Davide Sangiorgi: Light Logics and Higher-Order Processes. EXPRESS'10 2010: 46-60

Ugo Dal Lago, Simone Martini, Margherita Zorzi: General Ramified Recurrence is Sound for Polynomial Time. DICE 2010: 47-62

Adriano Fagiolini, Simone Martini, Antonio Bicchi: Set-valued consensus for distributed clock synchronization. CASE 2009: 116-121

Ugo Dal Lago, Simone Martini: Derivational Complexity Is an Invariant Cost Model. FOPARA 2009: 100-113

Ugo Dal Lago, Simone Martini: On Constructor Rewrite Systems and the Lambda-Calculus. ICALP (2) 2009: 163-174

Gian Luca Mariottini, Simone Martini, Magnus Egerstedt: A switching active sensing strategy to maintain observability for vision-based formation control. ICRA 2009: 2637-2642

Ugo Dal Lago, Simone Martini: On Constructor Rewrite Systems and the Lambda-Calculus. CoRR abs/0904.4120 (2009)

Ugo Dal Lago, Simone Martini: The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1-3): 32-50 (2008)

Simone Martini, Magnus Egerstedt, Antonio Bicchi: Controllability decompositions of networked systems through quotient graphs. CDC 2008: 5244-5249

Fabio Pasqualetti, Simone Martini, Antonio Bicchi: Steering a Leader-Follower Team Via Linear Consensus. HSCC 2008: 642-645

Michael Kaminski, Simone Martini (Eds.): Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings. Lecture Notes in Computer Science 5213, Springer 2008, isbn 978-3-540-87530-7

Paolo Coppola, Simone Martini: Optimizing optimal reduction: A type inference algorithm for elementary affine logic. ACM Trans. Comput. Log. 7(2): 219-260 (2006)

Ugo Dal Lago, Simone Martini: An Invariant Cost Model for the Lambda Calculus. CiE 2006: 105-114

Ugo Dal Lago, Simone Martini: An Invariant Cost Model for the Lambda Calculus. CoRR abs/cs/0511045 (2005)

Andrea Asperti, Paolo Coppola, Simone Martini: (Optimal) duplication is not elementary recursive. Inf. Comput. 193(1): 21-56 (2004)

Ugo Dal Lago, Simone Martini: Phase semantics and decidability of elementary affine logic. Theor. Comput. Sci. 318(3): 409-433 (2004)

Stefano Guerrini, Simone Martini, Andrea Masini: Coherence for sharing proof-nets. Theor. Comput. Sci. 294(3): 379-409 (2003)

Ugo Dal Lago, Simone Martini, Luca Roversi: Higher-Order Linear Ramified Recurrence. TYPES 2003: 178-193

Paolo Coppola, Simone Martini: Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic. CoRR cs.LO/0305011 (2003)

Stefano Guerrini, Simone Martini, Andrea Masini: Proof nets, garbage, and computations. Theor. Comput. Sci. 253(2): 185-237 (2001)

Paolo Coppola, Simone Martini: Typing Lambda Terms in Elementary Logic with Linear Constraints. TLCA 2001: 76-90

Andrea Asperti, Paolo Coppola, Simone Martini: (Optimal) Duplication is not Elementary Recursive. POPL 2000: 96-107

Stefano Guerrini, Simone Martini, Andrea Masini: An Analysis of (Linear) Exponentials Based on Extended Sequents. Logic Journal of the IGPL 6(5): 735-753 (1998)

Simone Martini, Andrea Masini: Experiments in Linear Natural Deduction. Theor. Comput. Sci. 176(1-2): 159-173 (1997)

Stefano Guerrini, Simone Martini, Andrea Masini: Proof Nets, Garbage, and Computations. TLCA 1997: 181-195

Stefano Guerrini, Simone Martini, Andrea Masini: Coherence for Sharing Proof Nets. RTA 1996: 215-229

Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping. Inf. Comput. 109(1/2): 4-56 (1994)

Simone Martini, Andrea Masini: A Modal View of Linear Logic. J. Symb. Log. 59(3): 888-899 (1994)

A. Bucci, Paola Inverardi, Simone Martini: An `Executable' Impredicative Semantics for the Ada Configuration. Formal Asp. Comput. 5(2): 91-120 (1993)

U. Bianchi, Pierpaolo Degano, Stefano Mannucci, Simone Martini, Bruno Mojana, Corrado Priami, E. Salvatori: Generating the analytic component parts of syntax-directed editors with efficient-error recovery. Journal of Systems and Software 23(1): 65-79 (1993)

Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter (Eds.): Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers. Lecture Notes in Computer Science 702, Springer 1993, isbn 3-540-56992-8

Andrea Asperti, Simone Martini: Categorical Models of Polymorphism. Inf. Comput. 99(1): 1-79 (1992)

Simone Martini: Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic. Mathematical Structures in Computer Science 2(3): 327-357 (1992)

Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping. TACS 1991: 750-770

Andrea Asperti, Simone Martini: Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. ICLP 1989: 337-352

Paola Inverardi, Simone Martini, Carlo Montangero: Is Type Checking Practical for System Configuration? TAPSOFT, Vol.2 1989: 257-271

Paolo Mancarella, Simone Martini, Dino Pedreschi: Complete Logic Programs with Domain-Closure Axiom. J. Log. Program. 5(3): 263-276 (1988)

Simone Martini: An Interval Model for Second-Order Lambda Calculus. Category Theory and Computer Science 1987: 219-237

Giuseppe Longo, Simone Martini: Computability in Higher Types, P omega and the Completeness of Type Assignment. Theor. Comput. Sci. 46(3): 197-217 (1986)

Giuseppe Longo, Simone Martini: Computability in Higher Types and the Universal Domain P_omega. STACS 1984: 186-197