Sökning: "lambda calculus"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden lambda calculus.

  1. 1. Functional Programming Languages and the JVM : Comparing Functional Language Compilation Techniques for the JVM

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Asta Olofsson; [2023]
    Nyckelord :Compilation; Functional Programming; Java; Kompilering; Funktionell Programmering; Java;

    Sammanfattning : Because of its security, high availability, and automatic memory management, the JVM (Java Virtual Machine) is a desirable execution environment. However, since the JVM was originally made for Java, which is an objectoriented language, it is hard for languages with other paradigms to run on it. LÄS MER

  3. 2. A Semantic Approach to Computation : Representing the Partial Recursive Functions in Lambda Calculus

    Kandidat-uppsats, Uppsala universitet/Algebra, logik och representationsteori

    Författare :Tim Solig; [2022]
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  4. 3. Formalizing domain models of the typed and the untyped lambda calculus in Agda

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :David Lidell; [2020-12-17]
    Nyckelord :Agda; categories with families; domain interpretation; lambda calculus; sized types;

    Sammanfattning : We present a domain interpretation of the simply typed and the untyped lambda calculus. The interpretations are constructed using the notion of category with families, with added structure. LÄS MER

  5. 4. Verifying Correctness of Contract Decompositions

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Gustav Hedengran; [2020]
    Nyckelord :;

    Sammanfattning : The importance of verification in safety critical systems is well known. However, due to the complexity of verification, the task of formally verifying large safety-critical systems might prove computationally infeasible in many cases. Compositional verification is a technique aimed at enabling verification of large safety-critical systems. LÄS MER

  7. 5. Compiling Agda to System Fω in Theory

    Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Gregor Ulm; [2015-07-20]
    Nyckelord :Languages; Lambda calculus and related systems; Types; Compilers;

    Sammanfattning : We develop a theoretical foundation for compiling the programming language Agda to System Fω, which is a stepping stone towards a compiler from Agda to Haskell. The practical relevance for software engineering and the problem of providing correctness guarantees for programs is highlighted. LÄS MER