![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Simone Martini 0001
Person information
- affiliation: University of Bologna, Italy
Other persons with the same name
- Simone Martini 0002 — University of Pisa, Research Center "E. Piaggio", Italy
- Simone Martini 0003 — Magneti Marelli S.p.A.TurinItaly
- Simone Martini 0004
— University of Denver, Denver, CO, USA
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Simone Martini
:
Teaching Programming in the Age of Generative AI. ITiCSE (1) 2024 - [c23]Michael Lodi
, Maria Cristina Carrisi
, Simone Martini
:
Big Ideas of Cryptography in Primary School. ITiCSE (1) 2024 - 2023
- [b2]Maurizio Gabbrielli, Simone Martini
, Saverio Giallorenzo:
Programming Languages: Principles and Paradigms, Second Edition. Undergraduate Topics in Computer Science, Springer 2023, ISBN 978-3-031-34143-4, pp. 1-549 - 2022
- [c22]Michael Lodi, Marco Sbaraglia, Simone Martini:
Cryptography in Grade 10: Core Ideas with Snap! and Unplugged. ITiCSE (1) 2022: 456-462 - 2021
- [j22]Marco Sbaraglia, Michael Lodi, Simone Martini:
A Necessity-Driven Ride on the Abstraction Rollercoaster of CS1 Programming. Informatics Educ. 20(4): 641-682 (2021) - [j21]Simone Martini
, Andrea Masini
, Margherita Zorzi
:
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics. ACM Trans. Comput. Log. 22(3): 19:1-19:29 (2021) - [c21]Michael Lodi, Marco Sbaraglia, Stefano Pio Zingaro
, Simone Martini:
The Online Course Was Great: I Would Attend It Face-to-Face: The Good, The Bad, and the Ugly of IT in Emergency Remote Teaching of CS1. GoodIT 2021: 242-247 - [c20]Marco Sbaraglia, Michael Lodi, Stefano Pio Zingaro
, Simone Martini:
The Good, The Bad, and The Ugly of a Synchronous Online CS1. ITiCSE (2) 2021: 660 - [i9]Michael Lodi, Marco Sbaraglia, Simone Martini:
Online Unplugged and Block-Based Cryptography in Grade 10. CoRR abs/2112.10437 (2021) - 2020
- [c19]Simone Martini
:
The Standard Model for Programming Languages: The Birth of a Mathematical Theory of Computation. Gabbrielli's Festschrift 2020: 8:1-8:13 - [i8]Simone Martini, Andrea Masini, Margherita Zorzi:
A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic. CoRR abs/2001.02029 (2020) - [i7]Simone Martini, Andrea Masini, Margherita Zorzi:
From 2-sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics. CoRR abs/2007.11875 (2020)
2010 – 2019
- 2018
- [c18]Roberto Borchia, Antonella Carbonaro
, Giorgio Casadei, Luca Forlizzi, Michael Lodi
, Simone Martini:
Problem Solving Olympics: An Inclusive Education Model for Learning Informatics. ISSEP 2018: 319-335 - 2017
- [i6]Stefano Guerrini, Simone Martini, Andrea Masini:
Quantum Turing Machines Computations and Measurements. CoRR abs/1703.07748 (2017) - 2016
- [j20]Ugo Dal Lago
, Simone Martini
, Davide Sangiorgi:
Light logics and higher-order processes. Math. Struct. Comput. Sci. 26(6): 969-992 (2016) - [c17]Simone Martini
:
Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract. CiE 2016: 164-169 - 2015
- [c16]Simone Martini:
Several Types of Types in Programming Languages. HaPoC 2015: 216-227 - [i5]Stefano Guerrini, Simone Martini, Andrea Masini:
Towards A Theory Of Quantum Computability. CoRR abs/1504.02817 (2015) - [i4]Simone Martini:
Several types of types in programming languages. CoRR abs/1510.03726 (2015) - 2012
- [j19]Ugo Dal Lago
, Simone Martini
:
On Constructor Rewrite Systems and the Lambda Calculus. Log. Methods Comput. Sci. 8(3) (2012) - 2010
- [b1]Maurizio Gabbrielli
, Simone Martini
:
Programming Languages: Principles and Paradigms. Undergraduate Topics in Computer Science, Springer 2010, ISBN 978-1-84882-913-8, pp. I-XIX, 1-440 - [j18]Michael Kaminski, Simone Martini
:
CSL 2008 special issue. ACM Trans. Comput. Log. 11(4): 21:1 (2010) - [c15]Ugo Dal Lago
, Simone Martini, Davide Sangiorgi:
Light Logics and Higher-Order Processes. EXPRESS 2010: 46-60 - [c14]Ugo Dal Lago
, Simone Martini, Margherita Zorzi:
General Ramified Recurrence is Sound for Polynomial Time. DICE 2010: 47-62
2000 – 2009
- 2009
- [c13]Ugo Dal Lago
, Simone Martini
:
Derivational Complexity Is an Invariant Cost Model. FOPARA 2009: 100-113 - [c12]Ugo Dal Lago
, Simone Martini
:
On Constructor Rewrite Systems and the Lambda-Calculus. ICALP (2) 2009: 163-174 - [i3]Ugo Dal Lago, Simone Martini:
On Constructor Rewrite Systems and the Lambda-Calculus. CoRR abs/0904.4120 (2009) - 2008
- [j17]Ugo Dal Lago
, Simone Martini
:
The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1-3): 32-50 (2008) - [e2]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. Lecture Notes in Computer Science 5213, Springer 2008, ISBN 978-3-540-87530-7 [contents] - 2006
- [j16]Paolo Coppola, Simone Martini
:
Optimizing optimal reduction: A type inference algorithm for elementary affine logic. ACM Trans. Comput. Log. 7(2): 219-260 (2006) - [c11]Ugo Dal Lago
, Simone Martini
:
An Invariant Cost Model for the Lambda Calculus. CiE 2006: 105-114 - 2005
- [i2]Ugo Dal Lago, Simone Martini:
An Invariant Cost Model for the Lambda Calculus. CoRR abs/cs/0511045 (2005) - 2004
- [j15]Andrea Asperti
, Paolo Coppola, Simone Martini
:
(Optimal) duplication is not elementary recursive. Inf. Comput. 193(1): 21-56 (2004) - [j14]Ugo Dal Lago
, Simone Martini
:
Phase semantics and decidability of elementary affine logic. Theor. Comput. Sci. 318(3): 409-433 (2004) - 2003
- [j13]Stefano Guerrini, Simone Martini
, Andrea Masini:
Coherence for sharing proof-nets. Theor. Comput. Sci. 294(3): 379-409 (2003) - [c10]Ugo Dal Lago, Simone Martini, Luca Roversi
:
Higher-Order Linear Ramified Recurrence. TYPES 2003: 178-193 - [i1]Paolo Coppola, Simone Martini:
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic. CoRR cs.LO/0305011 (2003) - 2001
- [j12]Stefano Guerrini, Simone Martini, Andrea Masini:
Proof nets, garbage, and computations. Theor. Comput. Sci. 253(2): 185-237 (2001) - [c9]Paolo Coppola, Simone Martini:
Typing Lambda Terms in Elementary Logic with Linear Constraints. TLCA 2001: 76-90 - 2000
- [c8]Andrea Asperti
, Paolo Coppola, Simone Martini:
(Optimal) Duplication is not Elementary Recursive. POPL 2000: 96-107
1990 – 1999
- 1998
- [j11]Stefano Guerrini, Simone Martini, Andrea Masini:
An Analysis of (Linear) Exponentials Based on Extended Sequents. Log. J. IGPL 6(5): 735-753 (1998) - 1997
- [j10]Simone Martini, Andrea Masini:
Experiments in Linear Natural Deduction. Theor. Comput. Sci. 176(1-2): 159-173 (1997) - [c7]Stefano Guerrini, Simone Martini
, Andrea Masini:
Proof Nets, Garbage, and Computations. TLCA 1997: 181-195 - 1996
- [c6]Stefano Guerrini, Simone Martini, Andrea Masini:
Coherence for Sharing Proof Nets. RTA 1996: 215-229 - 1994
- [j9]Franco Barbanera, Simone Martini
:
Proof-functional connectives and realizability. Arch. Math. Log. 33(3): 189-211 (1994) - [j8]Luca Cardelli
, Simone Martini
, John C. Mitchell, Andre Scedrov
:
An Extension of System F with Subtyping. Inf. Comput. 109(1/2): 4-56 (1994) - [j7]Simone Martini, Andrea Masini:
A Modal View of Linear Logic. J. Symb. Log. 59(3): 888-899 (1994) - 1993
- [j6]A. Bucci, Paola Inverardi, Simone Martini
:
An 'Executable' Impredicative Semantics for the Ada Configuration. Formal Aspects Comput. 5(2): 91-120 (1993) - [j5]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. J. Syst. Softw. 23(1): 65-79 (1993) - [e1]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. Lecture Notes in Computer Science 702, Springer 1993, ISBN 3-540-56992-8 [contents] - 1992
- [j4]Andrea Asperti
, Simone Martini
:
Categorical Models of Polymorphism. Inf. Comput. 99(1): 1-79 (1992) - [j3]Simone Martini:
Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic. Math. Struct. Comput. Sci. 2(3): 327-357 (1992) - 1991
- [c5]Luca Cardelli
, Simone Martini, John C. Mitchell, Andre Scedrov:
An Extension of System F with Subtyping. TACS 1991: 750-770
1980 – 1989
- 1989
- [c4]Andrea Asperti, Simone Martini:
Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. ICLP 1989: 337-352 - [c3]Paola Inverardi, Simone Martini, Carlo Montangero:
Is Type Checking Practical for System Configuration? TAPSOFT, Vol.2 1989: 257-271 - 1988
- [j2]Paolo Mancarella, Simone Martini
, Dino Pedreschi
:
Complete Logic Programs with Domain-Closure Axiom. J. Log. Program. 5(3): 263-276 (1988) - 1987
- [c2]Simone Martini:
An Interval Model for Second-Order Lambda Calculus. Category Theory and Computer Science 1987: 219-237 - 1986
- [j1]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
- [c1]Giuseppe Longo, Simone Martini:
Computability in Higher Types and the Universal Domain P_omega. STACS 1984: 186-197
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint