Sökning: "algebraic datatypes"

Hittade 5 avhandlingar innehållade orden algebraic datatypes.

  1. 1. 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

  3. 2. 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

  4. 3. Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus

    Författare :Johan Glimming; Karl Meinke; John Power; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; denotational semantics; axiomatic domain theory; coalgebra; primitive co recursion; object-based programming; typed object calculus; Computer science; Datavetenskap; datalogi; Computer Science;

    Sammanfattning : In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. LÄS MER

  5. 4. Enumerative Testing and Embedded Languages

    Författare :Jonas Almström Duregård; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis explores rapid experimental development of programming languages, with particular emphasis on effective semi-automatic testing. Our results are actualised in two Haskell libraries: BNFC-meta and Feat.BNFC-meta is an extension of the BNF Converter (BNFC) tool. LÄS MER

  7. 5. Call-by-name, Call-by-need, and McCarthy's Amb

    Författare :Andrew Keith Moran; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This dissertation examines the behaviour of McCarthy's amb in both a call-by-name and call-by-need context. Instead of following the usual denotational approach, we choose to explore the operational alternative. The languages involved are higher-order, and contain algebraic datatypes. LÄS MER