4,757 research outputs found
Dall'esperienza alla mostra "Pietro Scalcerle". Una vita e una scuola per la Città di Padova
No full textComposição química dos óleos de pracaxi e andiroba.
No full textLAGO, R. C. A.; SIQUEIRA, F. A. R. de. Composição química dos óleos de pracaxí e andiroba. p. 1-16. SZPIZ, R. R.; SIQUEIRA, F. A. R. de. Eliminação da cor verde do óleo de soja. p. 17-21. CASTRO, A. T. B. de; LAGO, R. C. A. Considerações sobre a determinação rápida do índice de iodo. p. 22-32. SZPIZ, R. R.; PEREIRA, D. A.; LAGO, R. C. A. Comparação entre óleos de 3 palmáceas brasileiras. p. 33-46. TEIXEIRA, C. G. Produção de álcool etílico de resíduos agrícolas. p. 47-54
Effectful applicative similarity for call-by-name lambda calculi
No full textWe introduce a notion of applicative similarity in which not terms but monadic values arising from the evaluation of effectful terms, can be compared. We prove this notion to be fully abstract whenever terms are evaluated in call-by-name order. This is the first full-abstraction result for such a generic, coinductive methodology for program equivalence
Effectful applicative similarity for call-by-name lambda calculi
No full textWe introduce a notion of applicative similarity in which not terms but monadic values arising from the evaluation of effectful terms, can be compared. We prove this notion to be fully abstract whenever terms are evaluated in call-by-name order. This is the first fullabstraction result for such a generic, coinductive methodology for program equivalence
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem
No full textLogical relations are one among the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be immediately proved by means of logical relations, for instance program continuity and differentiability in higher-order languages extended with real-valued functions. Informally, the problem stems from the fact that these properties are naturally expressed on terms of non-ground type (or, equivalently, on open terms of base type), and there is no apparent good definition for a base case (i.e. for closed terms of ground types). To overcome this issue, we study a generalization of the concept of a logical relation, called open logical relation, and prove that it can be fruitfully applied in several contexts in which the property of interest is about expressions of first-order type. Our setting is a simply-typed-calculus enriched with real numbers and real-valued first-order functions from a given set, such as the one of continuous or differentiable functions. We first prove a containment theorem stating that for any collection of real-valued first-order functions including projection functions and closed under function composition, any well-typed term of first-order type denotes a function belonging to that collection. Then, we show by way of open logical relations the correctness of the core of a recently published algorithm for forward automatic differentiation. Finally, we define a refinement-based type system for local continuity in an extension of our calculus with conditionals, and prove the soundness of the type system using open logical relations
In-Network Programmability for Next-generation Personal Cloud Service Support (INPUT)
No full textAbstractIn order to overcome the cloud service performance limits, the INPUT Project aims to go beyond the typical IaaS-based service models by moving computing and storage capabilities from the datacenters to the edge network, and consequently moving cloud services closer to the end users. This approach, which is compatible with the concept of fog computing, will exploit Network Functions Virtualization (NFV) and Software Defined Networking (SDN) to support personal cloud services in a more scalable and sustainable way and with innovative added-value capabilities
On Feller continuity and full abstraction
No full textWe study the nature of applicative bisimilarity in λ-calculi endowed with operators for sampling from contin- uous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide with contextual equivalence when real numbers can be manipulated through continuous functions only. The key ingredient towards this result is a notion of Feller-continuity for labelled Markov processes, which we believe of independent interest, giving rise a broad class of LMPs for which coinductive and logically inspired equivalences coincide. On the other hand, we show that if no constraint is put on the way real numbers are manipulated, characterizing contextual equivalence turns out to be hard, and most of the aforementioned notions of equivalence are even unsound
Ruolo delle connessioni dissipative tra pannelli di tamponamento delle strutture prefabbricate
No full text- …
