4 resultados para pi-Acceptors
em AMS Tesi di Dottorato - Alm@DL - Università di Bologna
Resumo:
The thesis focuses on the link between education and poverty. The first part of the work investigates these concepts through a multidisciplinary study (History, Anthropology, Sociology, Psychology, Pedagogy) to show the complexity of the phenomena, and analyzes poverty considering it as an educational challenge. The second part presents the outcomes of a qualitative research about the role and the power that education has in the fight against poverty. The interviews and the focus groups with teachers and educators who work with the poor in several Italian cities and abroad (Denver and Los Angeles, Israel and Palestine), and the observations of the educational work done in some schools and services considered the "best practices" highlight the importance to re-educate our society, that is impoverished by the crisis of welfare state and the weakness of social networks. The final chapter is dedicated to a reflection on social justice, solidarity and sobriety, as pillars for Social Pedagogy in a society that cannot close its eyes to the inequalities that it generates.
Resumo:
Il principale obiettivo della tesi è dimostrare come la connessione tra i differenti livelli giuridici che riguardano le relazioni tra Stati membri dell'UE richieda un'interpretazione sistematica delle convenzioni contro le doppie imposizioni intracomunitarie, ed in particolare richieda l'applicazione della clausola della nazione più favorita.
Resumo:
In this thesis, I study the notion of program equivalences, i.e. proving that two programs can be used interchangeably without altering the overall observable behaviour. This definition is highly dependent on the contexts in which these programs can be used; does the context have exceptions, parallelism, etc... So proofs also need to be adapted according to the expressiveness of those contexts. This thesis presents on the pi-calculus – a concurrent programming language – under various typing constraints. Types allows us to impose different disciplines like forcing a sequential execution, or ensuring linearity, meaning an object can be used once. In each case, the bisimulation, a standard proof technique for the pi-calculus, needs to be adapted accordingly to obtain a suitable equivalence. We then test how using the modified bisimulations can be used to reason about a language with higher-order functions and references, which once translated into the pi-calculus satisfies the typing constraints.