S. Martini

Publications90
h-index18
Citations1,454
Highly Influential Citations91
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Ugo Dal Lago
  • 200 Publications • 2,356 Citations
  • A. Masini
  • 55 Publications • 519 Citations
  • A. Bicchi
  • 722 Publications • 22,885 Citations
  • A. Asperti
  • 154 Publications • 2,954 Citations
  • Publications
  • Influence
An Extension of System F with Subtyping
TLDR
The main focus of the paper is the equational theory of F<:, which is related to PER models and the notion of parametricity, and some categorical properties of the theory when restricted to closed terms, including interesting categorical isomorphisms.
View via Publisher
Programming Languages: Principles and Paradigms
TLDR
The author explains the main programming paradigms (imperative, object-oriented, functional, and logic), and makes clear separation between the design, implementation and pragmatic aspects of programming languages.
View via Publisher
Controllability analysis of multi-agent systems using relaxed equitable partitions
This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively 'reprogrammed'. In…
View via Publisher
A Computational Interpretation of Modal Proofs
Proof theory of modal logics, though largely studied since the fifties, has always been a delicate subject, the main reason being the apparent impossibility to obtain elegant, natural systems for…
View via Publisher
Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
As networked dynamical systems appear around us at an increasing rate, questions concerning how to manage and control such systems are becoming more important. Examples include multiagent robotics,…
View on IEEE
The weak lambda calculus as a reasonable machine
View via Publisher
An Extension of System F with Subtyping
TLDR
An extension of F, called F<:, is studied, that combines parametric polymorphism with subtyping and provides a basis for polymorphic programming languages.
View via Publisher
Proof-functional connectives and realizability
TLDR
For each of these connectives, strong equivalence, strong conjunction and relevant implication are studied, a type assignment system, a realizability semantics, and a completeness theorem are given.
View on Springer
Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs
Derivational Complexity Is an Invariant Cost Model
We show that in the context of orthogonal term rewriting systems, derivational complexity is an invariant cost model, both in innermost and in outermost reduction. This has some interesting…
View via Publisher
...
...