Sökning: "higher order programming"

Visar resultat 1 - 5 av 50 avhandlingar innehållade orden higher order programming.

  1. 1. Definitional program separation

    Författare :Göran Falkman; Chalmers University of Technology; []
    Nyckelord :definitional programming; algorithmic form; algorithmic content; higher order programming; definitions; program separation;

    Sammanfattning : .... LÄS MER

  2. 2. Language-based Approaches to Safe and Efficient Distributed Programming

    Författare :Xin Zhao; Philipp Haller; Roberto Guanciale; Wolfgang De Meuter; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; Programming languages; Distributed systems; Type system; Replicated data types; Datalogi; Computer Science;

    Sammanfattning : Distributed systems address the increasing demand for fast access to resources and fault tolerance for data. Strong consistency ensures that all clients observe consistent data updates atomically on all servers in a distributed system, and it is widely used in systems such as relational databases. LÄS MER

  3. 3. Positive supercompilation for a higher-order call-by-value language

    Författare :Peter A. Jonsson; Luleå tekniska universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : Intermediate structures such as lists and higher-order functions are very common in most styles of functional programming. While allowing the programmer to write clear and concise programs, the creation and destruction of these structures impose a run time overhead which is not negligible. LÄS MER

  4. 4. Reactive Objects and Functional Programming

    Författare :Johan Nordlander; Chalmers University of Technology; []
    Nyckelord :;

    Sammanfattning : The construction of robust distributed and interactive software is still a challenging task, despite the recent popularity-increase for languages that take advanced programming concepts into the mainstream. Several problematic areas can be identified: most languages require the reactivity of a system to be manually upheld by careful avoidance of blocking operations; mathematical values often need to be encoded in terms of stateful objects or vice versa; concurrency is particularly tricky in conjunction with encapsulated software components; and static type safety is often compromised because of the lack of simultaneous support for both subtyping and polymorphism. LÄS MER

  5. 5. Approximation of Infinitely Divisible Random Variables with Application to the Simulation of Stochastic Processes

    Författare :Magnus Wiktorsson; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; operations research; Statistics; aktuariematematik; Stochastic differential equation; Infinitely divisible distribution; Type G distribution; Lévy process; Stochastic integral; Mathematical Statistics; Matematik; Mathematics; programming; actuarial mathematics; Statistik; operationsanalys; programmering;

    Sammanfattning : This thesis consists of four papers A, B, C and D. Paper A and B treats the simulation of stochastic differential equations (SDEs). The research presented therein was triggered by the fact that there were not any efficient implementations of the higher order methods for simulating SDEs. LÄS MER