| 2009 |
|---|
| 33 | EE | Ugo Dal Lago,
Simone Martini:
On Constructor Rewrite Systems and the Lambda-Calculus
CoRR abs/0904.4120: (2009) |
| 2008 |
|---|
| 32 | | Michael Kaminski,
Simone Martini:
Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings
Springer 2008 |
| 31 | EE | Fabio Pasqualetti,
Simone Martini,
Antonio Bicchi:
Steering a Leader-Follower Team Via Linear Consensus.
HSCC 2008: 642-645 |
| 30 | EE | Ugo Dal Lago,
Simone Martini:
The weak lambda calculus as a reasonable machine.
Theor. Comput. Sci. 398(1-3): 32-50 (2008) |
| 2006 |
|---|
| 29 | EE | Ugo Dal Lago,
Simone Martini:
An Invariant Cost Model for the Lambda Calculus.
CiE 2006: 105-114 |
| 28 | EE | Paolo Coppola,
Simone Martini:
Optimizing optimal reduction: A type inference algorithm for elementary affine logic.
ACM Trans. Comput. Log. 7(2): 219-260 (2006) |
| 2005 |
|---|
| 27 | EE | Ugo Dal Lago,
Simone Martini:
An Invariant Cost Model for the Lambda Calculus
CoRR abs/cs/0511045: (2005) |
| 2004 |
|---|
| 26 | EE | Andrea Asperti,
Paolo Coppola,
Simone Martini:
(Optimal) duplication is not elementary recursive.
Inf. Comput. 193(1): 21-56 (2004) |
| 25 | EE | Ugo Dal Lago,
Simone Martini:
Phase semantics and decidability of elementary affine logic.
Theor. Comput. Sci. 318(3): 409-433 (2004) |
| 2003 |
|---|
| 24 | EE | Ugo Dal Lago,
Simone Martini,
Luca Roversi:
Higher-Order Linear Ramified Recurrence.
TYPES 2003: 178-193 |
| 23 | EE | Paolo Coppola,
Simone Martini:
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic
CoRR cs.LO/0305011: (2003) |
| 22 | | Stefano Guerrini,
Simone Martini,
Andrea Masini:
Coherence for sharing proof-nets.
Theor. Comput. Sci. 294(3): 379-409 (2003) |
| 2001 |
|---|
| 21 | EE | Paolo Coppola,
Simone Martini:
Typing Lambda Terms in Elementary Logic with Linear Constraints.
TLCA 2001: 76-90 |
| 20 | EE | Stefano Guerrini,
Simone Martini,
Andrea Masini:
Proof nets, garbage, and computations.
Theor. Comput. Sci. 253(2): 185-237 (2001) |
| 2000 |
|---|
| 19 | EE | Andrea Asperti,
Paolo Coppola,
Simone Martini:
(Optimal) Duplication is not Elementary Recursive.
POPL 2000: 96-107 |
| 1998 |
|---|
| 18 | EE | 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) |
| 1997 |
|---|
| 17 | | Stefano Guerrini,
Simone Martini,
Andrea Masini:
Proof Nets, Garbage, and Computations.
TLCA 1997: 181-195 |
| 16 | EE | Simone Martini,
Andrea Masini:
Experiments in Linear Natural Deduction.
Theor. Comput. Sci. 176(1-2): 159-173 (1997) |
| 1996 |
|---|
| 15 | | Stefano Guerrini,
Simone Martini,
Andrea Masini:
Coherence for Sharing Proof Nets.
RTA 1996: 215-229 |
| 1994 |
|---|
| 14 | | Luca Cardelli,
Simone Martini,
John C. Mitchell,
Andre Scedrov:
An Extension of System F with Subtyping
Inf. Comput. 109(1/2): 4-56 (1994) |
| 13 | | Simone Martini,
Andrea Masini:
A Modal View of Linear Logic.
J. Symb. Log. 59(3): 888-899 (1994) |
| 1993 |
|---|
| 12 | | Egon Börger,
Gerhard Jäger,
Hans Kleine Büning,
Simone Martini,
Michael M. Richter:
Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers
Springer 1993 |
| 11 | | A. Bucci,
Paola Inverardi,
Simone Martini:
An `Executable' Impredicative Semantics for the Ada Configuration.
Formal Asp. Comput. 5(2): 91-120 (1993) |
| 10 | EE | 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) |
| 1992 |
|---|
| 9 | | Andrea Asperti,
Simone Martini:
Categorical Models of Polymorphism
Inf. Comput. 99(1): 1-79 (1992) |
| 8 | | Simone Martini:
Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic.
Mathematical Structures in Computer Science 2(3): 327-357 (1992) |
| 1991 |
|---|
| 7 | | Luca Cardelli,
Simone Martini,
John C. Mitchell,
Andre Scedrov:
An Extension of System F with Subtyping.
TACS 1991: 750-770 |
| 1989 |
|---|
| 6 | | Andrea Asperti,
Simone Martini:
Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs.
ICLP 1989: 337-352 |
| 5 | | Paola Inverardi,
Simone Martini,
Carlo Montangero:
Is Type Checking Practical for System Configuration?
TAPSOFT, Vol.2 1989: 257-271 |
| 1988 |
|---|
| 4 | | Paolo Mancarella,
Simone Martini,
Dino Pedreschi:
Complete Logic Programs with Domain-Closure Axiom.
J. Log. Program. 5(3): 263-276 (1988) |
| 1987 |
|---|
| 3 | | Simone Martini:
An Interval Model for Second-Order Lambda Calculus.
Category Theory and Computer Science 1987: 219-237 |
| 1986 |
|---|
| 2 | | Giuseppe Longo,
Simone Martini:
Computability in Higher Types, P omega and the Completeness of Type Assignment.
Theor. Comput. Sci. 46(3): 197-217 (1986) |
| 1984 |
|---|
| 1 | | Giuseppe Longo,
Simone Martini:
Computability in Higher Types and the Universal Domain P_omega.
STACS 1984: 186-197 |
