Sökning: "programming languages"

Visar resultat 1 - 5 av 173 avhandlingar innehållade orden programming languages.

1. 1. Functional Polytypic Programming

   Författare :Patrik Jansson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; algebraic datatypes; functional programming; programming languages; polytypic programming; generic programming;

   Sammanfattning : Many algorithms have to be implemented over and over again for different datatypes, either because datatypes change during the development of programs, or because the same algorithm is used for several datatypes. Examples of such algorithms are equality tests, pretty printers, and pattern matchers, and polytypic programming is a paradigm for expressing such algorithms. LÄS MER

3. 2. Functional Polytypic Programming --- Use and Implementation

   Författare :Patrik Jansson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Functional programming; Algebraic datatypes; Generic programming; Polytypic programming; Programming languages;

   Sammanfattning : Many functions have to be written over and over again for different datatypes, either because datatypes change during the development of programs, or because functions with similar functionality are needed on different datatypes. Examples of such functions are pretty printers, pattern matchers, equality functions, unifiers, rewriting functions, etc. LÄS MER

4. 3. Embedded Languages for Data-Parallel Programming

   Författare :Joel Bo Svensson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graphics Processing Units; Data-parallelism; Functional Programming; Embedded languages;

   Sammanfattning : Computers today are becoming more and more parallel. General purpose processors (CPUs) have multiple processing cores and Single Instruction Multiple Data (SIMD) units for data-parallelism. Graphics processors (GPUs) bring massive parallelism at the cost of being harder to program than CPUs. LÄS MER

5. 4. 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

7. 5. Compile-time Safety and Runtime Performance in Programming Frameworks for Distributed Systems

   Författare :Lars Kroll; Seif Haridi; Jim Dowling; Peter Van Roy; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; distributed systems; distributed computing; programming systems; programming languages; computer science; domain specific languages; message-passing; actor model; component model; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : Distributed Systems, that is systems that must tolerate partial failures while exploiting parallelism, are a fundamental part of the software landscape today. Yet, their development and design still pose many challenges to developers when it comes to reliability and performance, and these challenges often have a negative impact on developer productivity. LÄS MER