Search for dissertations about: "meta programming"

Showing result 1 - 5 of 17 swedish dissertations containing the words meta programming.

2. 1. Representation of Compositional Relational Programs

   Author : Görkem Paçacı; Andreas Hamfelt; Alberto Pettorossi; Uppsala universitet; []
   Keywords : 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;

   Abstract : 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. READ MORE

4. 2. Language-Based Techniques and Stochastic Models for Automated Testing

   Author : Claudio Agustin Mista; Chalmers tekniska högskola; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; automated testing; software testing; stochastic methods; meta-programming; functional programming;

   Abstract : As software systems become bigger and scarier, automating their testing is crucial to ensure that our confidence in them can keep up with their growth. In this setting, Generational Fuzzing and Random Property-Based Testing are two sides of the same testing technique that can help us find bugs effectively without having to spend countless hours writing unit tests by hand. READ MORE

5. 3. Computational Issues in Calculi of Partial Inductive Definitions

   Author : Per Kreuger; RISE; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

   Abstract : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. READ MORE

6. 4. Implementing Functional Generic Programming

   Author : Ulf Norell; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : Functional generic programming extends functional programming with the ability to parameterize functions on the structure of a datatype. This allows a programmer to implement certain algorithms once and for all, instead of re-implementing them for each datatype they apply to. READ MORE

7. 5. Contributions to Meta-Modeling Tools and Methods

   Author : Adrian Pop; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

   Abstract : Highly integrated domain-specific environments are essential for the efficient design of complex physical products. However, developing such design environments is today a resource-consuming error-prone process that is largely manual. Meta-modeling and meta-programming are the key to the efficient development of such environments. READ MORE