<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Community:</title>
    <link>https://repositorio.ufu.br/handle/123456789/5142</link>
    <description />
    <pubDate>Sun, 19 Jul 2026 14:14:44 GMT</pubDate>
    <dc:date>2026-07-19T14:14:44Z</dc:date>
    <image>
      <title>DSpace Community:</title>
      <url>https://repositorio.ufu.br:443/retrieve/9bc49516-3b2d-430b-b40d-367ebc2fccfc/logo-facom.png</url>
      <link>https://repositorio.ufu.br/handle/123456789/5142</link>
    </image>
    <item>
      <title>Desenvolvendo um sistema de controle financeiro pessoal</title>
      <link>https://repositorio.ufu.br/handle/123456789/48896</link>
      <description>Title: Desenvolvendo um sistema de controle financeiro pessoal</description>
      <pubDate>Fri, 27 Feb 2026 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://repositorio.ufu.br/handle/123456789/48896</guid>
      <dc:date>2026-02-27T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Higher-order Virtual Machine 3: uma reconstrução racional</title>
      <link>https://repositorio.ufu.br/handle/123456789/48895</link>
      <description>Title: Higher-order Virtual Machine 3: uma reconstrução racional
Abstract: Higher-order Virtual Machine 3 (HVM3) is a compiler that generates high-performance code based on interaction nets. It stands out for its potential for massively parallel execution in its strict version and for the optimal reduction of λ-calculus terms in its lazy version. Despite its promising properties, its operational complexity and the lack of educational documentation represent a barrier for new researchers and developers. This work aims to fill this gap by providing an incremental and detailed description of the syntax, semantics, and inner workings of HVM3, with a focus on its Lazy version. Starting from the theoretical foundations of λ-calculus and interaction combinators, the virtual machine is reconstructed step-by-step through a series of sub-machines, each adding new features to the previous one. The process begins with the memory model, evolving into the implementation of interaction combinators, and subsequently incorporating arithmetic operations, references, pattern matching for Algebraic Data Types (ADTs), reduction prioritization mechanisms, and more. The result is a documentation that serves as a guide for understanding HVM3, making this powerful computational model more accessible and fostering future research in the field.</description>
      <pubDate>Tue, 23 Sep 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://repositorio.ufu.br/handle/123456789/48895</guid>
      <dc:date>2025-09-23T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Análise do uso de DNS seguro como estratégia de proteção digital</title>
      <link>https://repositorio.ufu.br/handle/123456789/48871</link>
      <description>Title: Análise do uso de DNS seguro como estratégia de proteção digital</description>
      <pubDate>Tue, 24 Mar 2026 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://repositorio.ufu.br/handle/123456789/48871</guid>
      <dc:date>2026-03-24T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Construção de um conjunto de dados de tráfego DNS para apoio à detecção de exfiltração de dados</title>
      <link>https://repositorio.ufu.br/handle/123456789/48847</link>
      <description>Title: Construção de um conjunto de dados de tráfego DNS para apoio à detecção de exfiltração de dados</description>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://repositorio.ufu.br/handle/123456789/48847</guid>
      <dc:date>2026-03-27T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

