Sökning: "Combinatory Logic"

Hittade 2 avhandlingar innehållade orden Combinatory Logic.

  1. 1. Representation of Compositional Relational Programs

    Författare :Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Programming; Syntax; Logic Programming; Combilog; CombInduce; Prolog; Variable-free; Point-free; Tacit; Compositional Relational Programming; Combinatory Logic; Predicate-Functor Logic; Program Synthesis; Meta-interpreters; Meta-interpretative Synthesis; Decompositional Synthesis; Inductive Synthesis; Inductive Logic Programming; Usability; Cognitive Dimensions of Notations; Visual Variables; Usability testing; Programming Language usability; Empirical evidence; Informationssystem; Information Systems;

    Sammanfattning : Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. LÄS MER

  2. 2. A Type Theoretical Analysis of Some Aspects of Programming Languages

    Författare :Verónica Gaspes; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We present three papers on the application of Martin-Löf's type theory to the analysis of programming languages. In the first paper, we present formal proofs in type theory of the combinatorial completeness of two calculi of combinators. The statement formulates the ability of the calculi to describe functions. LÄS MER