On Reasonable Space and Time Cost Models for the λ-Calculus

Slot and van Emde Boas Invariance Thesis states that a time (respectively, space) cost model is reasonable for a computational model C if there are mutual simulations between Turing machines and C such that the overhead is polynomial in time (respectively, linear in space). The rationale is that under the Invariance Thesis, complexity classes such as LOGSPACE, P, PSPACE, become robust, i.e. machine independent. In this dissertation, we want to find out if it possible to define a reasonable space cost model for the lambda-calculus, the paradigmatic model for functional programming languages. We start by considering an unusual evaluation mechanism for the lambda-calculus, based on Girard's Geometry of Interaction, that was conjectured to be the key ingredient to obtain a space reasonable cost model. By a fine complexity analysis of this schema, based on new variants of non-idempotent intersection types, we disprove this conjecture. Then, we change the target of our analysis. We consider a variant over Krivine's abstract machine, a standard evaluation mechanism for the call-by-name lambda-calculus, optimized for space complexity, and implemented without any pointer. A fine analysis of the execution of (a refined version of) the encoding of Turing machines into the lambda-calculus allows us to conclude that the space consumed by this machine is indeed a reasonable space cost model. In particular, for the first time we are able to measure also sub-linear space complexities. Moreover, we transfer this result to the call-by-value case. Finally, we provide also an intersection type system that characterizes compositionally this new reasonable space measure. This is done through a minimal, yet non trivial, modification of the original de Carvalho type system.

Biotechnological approaches to valorize alternative protein source, waste and by-products from food industries

The PhD research project was a striking example of the enhancement of milling by-product and alternative protein sources from house cricket (Acheta domesticus), conceived as sustainable and renewable sources, to produce innovative food products. During milling processing of wheat and rye, several by-products with high technological and functional potential, are produced. The use of selected microbial consortia, allowed to obtain a pre-fermented ingredient for use in the bakery. The pre-ferments obtained were characterized by a high technological, functional and nutritional value, also interesting from a nutraceutical point of view. Bakery products obtained by the addition of pre-fermented ingredients were characterized by a greater quantity of aromatic molecules and an increase in SCFA, antioxidant activity, total amino acids and total phenols resulting in positive effect on the functionality. Moreover, the industrial scaling-up of pre-ferment and innovative bakery goods production, developed in this research, underlined the technological applicability of pre-fermented ingredients on a large scale. Moreover, the identification of innovative protein sources, can address the request of new sustainable ingredients able to less impact on the environment and to satisfy the food global demand. To upscale the insect production and ensure food safety of insect-based products, biotechnological formulations based on Acheta domesticus powder were optimized. The use of Yarrowia lipolytica in the biotechnological transformation of cricket powder led to the achievement of a cricket-based food ingredient characterized by a reduced content of chitin and an increase of antimicrobial and health-promoting molecules. The innovative bakery products containing cricket-based hydrolysates from Y. lipolytica possessed specific sensory, qualitative and functional characteristics to the final product. Moreover, the combination of Y. lipolytica hydrolysis and baking showed promising results regarding a reduced allergenicity in cricket-based baked products. Thus, the hydrolysate of cricket powder may represent a versatile and promising ingredient in the production of innovative foods.

Crystal engineering strategies against antimicrobial resistance: a solid contribution to a contemporary problem

This PhD thesis sets its goal in the application of crystal engineering strategies to the design, formulation, synthesis, and characterization of innovative materials obtained by combining well established biologically active molecules and/or GRAS (generally recognized as safe) compounds with co-formers able to modulate specific properties of the molecule of interest. The solid-state association, via non-covalent interactions, of an active ingredient with another molecular component, a metal salt or a complex, may alter in a useful way the physicochemical properties of the active ingredient and/or may allow to explore new ways to enhance, in a synergistic way, the overall biological performance. More specifically this thesis will address the threat posed by the increasing antimicrobial resistance (AMR) developed by microorganisms, which call for novel therapeutic strategies. Crystal engineering provides new tools to approach this crisis in a greener and cost-effective way. This PhD work has been developed along two main research lines aiming to contribute to the search for innovative solutions to the AMR problem. Design, preparation and characterization of novel metal-based antimicrobials, whereby organic molecules with known antimicrobial properties are combined with metal atoms also known to exert antimicrobial action. Design, preparation and characterization of co-crystals obtained by combining antibacterial APIs (active pharmaceutical ingredients) with natural antimicrobials.

Towards a logical foundation of randomized computation

This dissertation investigates the relations between logic and TCS in the probabilistic setting. It is motivated by two main considerations. On the one hand, since their appearance in the 1960s-1970s, probabilistic models have become increasingly pervasive in several fast-growing areas of CS. On the other, the study and development of (deterministic) computational models has considerably benefitted from the mutual interchanges between logic and CS. Nevertheless, probabilistic computation was only marginally touched by such fruitful interactions. The goal of this thesis is precisely to (start) bring(ing) this gap, by developing logical systems corresponding to specific aspects of randomized computation and, therefore, by generalizing standard achievements to the probabilistic realm. To do so, our key ingredient is the introduction of new, measure-sensitive quantifiers associated with quantitative interpretations. The dissertation is tripartite. In the first part, we focus on the relation between logic and counting complexity classes. We show that, due to our classical counting propositional logic, it is possible to generalize to counting classes, the standard results by Cook and Meyer and Stockmeyer linking propositional logic and the polynomial hierarchy. Indeed, we show that the validity problem for counting-quantified formulae captures the corresponding level in Wagner's hierarchy. In the second part, we consider programming language theory. Type systems for randomized \lambda-calculi, also guaranteeing various forms of termination properties, were introduced in the last decades, but these are not "logically oriented" and no Curry-Howard correspondence is known for them. Following intuitions coming from counting logics, we define the first probabilistic version of the correspondence. Finally, we consider the relationship between arithmetic and computation. We present a quantitative extension of the language of arithmetic able to formalize basic results from probability theory. This language is also our starting point to define randomized bounded theories and, so, to generalize canonical results by Buss.