636 research outputs found
L'asset allocation in presenza di tassi di interesse negativi
No full textDopo aver definito il contesto di riferimento, lo studio esamina le scelte di investimento di famiglie e intermediari finanziari. Esso inoltre propone un'applicazione empirica delle consolidate metodologie di definizione dell'asset allocation, opportunamente modificate per tener conto dei tassi risk-free negativi, e sviluppa alcune riflessioni, basate sui paradigmi della finanza comportamentale, per orientare le scelte di investimento in presenza di tassi negativi
Architetture in terra a Macerata: il quartiere di Villa Ficana. Analisi conoscitiva per il recupero.
No full textArchitetture in terra a Macerata: il quartiere di Villa Ficana. Analisi conoscitiva per il recupero. Stato dell'Arte.
No full textWorking with Mathematical Structures in Type Theory
No full textWe address the problem of representing mathematical structures in a proof assistant which: 1) is based on a type theory with dependent types, telescopes and a computational version of Leibniz equality; 2) implements coercive subtyping, accepting multiple coherent paths between type families; 3) implements a restricted form of higher order unification and type reconstruction. We show how to exploit the previous quite common features to reduce the ``syntactic'' gap between pen&paper and formalised algebra. However, to reach our goal we need to propose unification and type reconstruction heuristics that are slightly different from the ones usually implemented. We have implemented them in Matit
Nonuniform Coercions via Unification Hints
No full textWe introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in the literature and they arise naturally when formalizing mathematics in an higher order interactive theorem prover using convenient devices like canonical structures, type classes or unification hints. We also show how nonuniform coercions can be naturally implemented at the user level in an interactive theorem prover that allows unification hints
Natural Deduction Environment for Matita
No full textMatita is a proof assistant characterised by a rich, user extensible, output facility based on a widget for the rendering of MathML Presentation, and by the automatic handling of overloading by means of a flexible disambiguation mechanism. We show how to use these features to obtain a simple learning environment for natural deduction, without modifying the source code or Matita
Supplemental material for Small vessel disease and biomarkers of endothelial dysfunction after ischaemic stroke
No full textSupplemental material for Small vessel disease and biomarkers of endothelial dysfunction after ischaemic stroke by Francesco Arba, Alessio Giannini, Benedetta Piccardi, Silvia Biagini, Vanessa Palumbo, Betti Giusti, Patrizia Nencini, Anna Maria Gori, Mascia Nesi, Giovanni Pracucci, Giorgio Bono, Paolo Bovi, Enrico Fainardi, Domenico Consoli, Antonia Nucera, Francesca Massaro, Giovanni Orlandi, Francesco Perini, Rossana Tassi, Maria Sessa, Danilo Toni, Rosanna Abbate and Domenico Inzitari in European Stroke Journal</p
Formalising Overlap Algebras in Matita
No full textWe describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that they also ease the formalization of formal topological results in an interactive theorem prover.
Our main result is the existence of a functor between two categories of ‘generalized topological spaces’, one with points (Basic Pairs) and the other point-free (Basic Topologies).
The reported formalization is part as a wider scientific collaboration with the inventor of the theory, Giovanni Sambin. His goal is to verify in what sense, and with what difficulties, his theory is ‘implementable’. We check that all intermediate constructions respect the stringent size requirements imposed by predicative logic. The formalization is quite unusual, since it has to make explicit size information that is often hidden.
We found that the version of Matita used for the formalization was largely
inappropriate. The formalization drove several major improvements of Matita that will be integrated in the next major release (Matita 1.0). We show some motivating examples for these improvements, taken directly from the formalization. We also describe a possibly sub-optimal solution in Matita 1/2, exploitable in other similar systems. We briefly discuss a better solution available in Matita 1.0
- …
