Simone Martini

Orcid: 0000-0002-9834-1940

Affiliations:
  • University of Bologna, Italy


According to our database1, Simone Martini authored at least 47 papers between 1984 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Unplugged Didactical Situation on Cryptography between Informatics and Mathematics.
Informatics Educ., 2024

Big Ideas of Cryptography in Primary School.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1, 2024

Teaching Programming in the Age of Generative AI.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1, 2024

2023
Programming Languages: Principles and Paradigms, Second Edition
Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-031-34143-4, 2023

2022
Cryptography in Grade 10: Core Ideas with Snap! and Unplugged.
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

2021
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics.
ACM Trans. Comput. Log., 2021

A Necessity-Driven Ride on the Abstraction Rollercoaster of CS1 Programming.
Informatics Educ., 2021

Online Unplugged and Block-Based Cryptography in Grade 10.
CoRR, 2021

The Good, The Bad, and The Ugly of a Synchronous Online CS1.
Proceedings of the ITiCSE '21: Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V.2, Virtual Event, Germany, June 26, 2021

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.
Proceedings of the GoodIT '21: Conference on Information Technology for Social Good, 2021

2020
A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic.
CoRR, 2020

The Standard Model for Programming Languages: The Birth of a Mathematical Theory of Computation.
Proceedings of the Recent Developments in the Design and Implementation of Programming Languages, 2020

2018
Problem Solving Olympics: An Inclusive Education Model for Learning Informatics.
Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

2017
Quantum Turing Machines Computations and Measurements.
CoRR, 2017

2016
Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Towards A Theory Of Quantum Computability.
CoRR, 2015

Several Types of Types in Programming Languages.
Proceedings of the History and Philosophy of Computing - Third International Conference, 2015

2012
On Constructor Rewrite Systems and the Lambda Calculus
Log. Methods Comput. Sci., 2012

2010
Programming Languages: Principles and Paradigms.
Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84882-914-5, 2010

CSL 2008 special issue.
ACM Trans. Comput. Log., 2010

Light Logics and Higher-Order Processes
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

General Ramified Recurrence is Sound for Polynomial Time
Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

2009
Derivational Complexity Is an Invariant Cost Model.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008
The weak lambda calculus as a reasonable machine.
Theor. Comput. Sci., 2008

2006
Optimizing optimal reduction: A type inference algorithm for elementary affine logic.
ACM Trans. Comput. Log., 2006

An Invariant Cost Model for the Lambda Calculus.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2004
Phase semantics and decidability of elementary affine logic.
Theor. Comput. Sci., 2004

(Optimal) duplication is not elementary recursive.
Inf. Comput., 2004

2003
Coherence for sharing proof-nets.
Theor. Comput. Sci., 2003

Higher-Order Linear Ramified Recurrence.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2001
Proof nets, garbage, and computations.
Theor. Comput. Sci., 2001

Typing Lambda Terms in Elementary Logic with Linear Constraints.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1998
An Analysis of (Linear) Exponentials Based on Extended Sequents.
Log. J. IGPL, 1998

1997
Experiments in Linear Natural Deduction.
Theor. Comput. Sci., 1997

1994
A Modal View of Linear Logic.
J. Symb. Log., 1994

An Extension of System F with Subtyping
Inf. Comput., 1994

Proof-functional connectives and realizability.
Arch. Math. Log., 1994

1993
Generating the analytic component parts of syntax-directed editors with efficient-error recovery.
J. Syst. Softw., 1993

An 'Executable' Impredicative Semantics for the Ada Configuration.
Formal Aspects Comput., 1993

1992
Categorical Models of Polymorphism
Inf. Comput., July, 1992

Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic.
Math. Struct. Comput. Sci., 1992

1989
Is Type Checking Practical for System Configuration?
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs.
Proceedings of the Logic Programming, 1989

1988
Complete Logic Programs with Domain-Closure Axiom.
J. Log. Program., 1988

1987
An Interval Model for Second-Order Lambda Calculus.
Proceedings of the Category Theory and Computer Science, 1987

1986
Computability in Higher Types, P omega and the Completeness of Type Assignment.
Theor. Comput. Sci., 1986

1984
Computability in Higher Types and the Universal Domain P_omega.
Proceedings of the STACS 84, 1984


  Loading...