Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 19532 for “"languages"”.

  1. Compiling dynamic languages via statically typed functional languages

    Dynamic languages enable rapid prototyping, but are generally not viewed as providing the best performance. As a result, software developers generally build a prototype in a dynamic language and then rewrite the application in C or Fortran for high performance. This costly rewriting step can be …

    rice Repository record for Compiling dynamic languages via statically typed functional languages (opens in a new tab)

  2. Techniques for implementing embedded domain specific languages in dynamic languages

    … in easily understandable parts. General languages provide tools and abstractions that allow many different problems to be formulated and solved. Unfortunately, these abstraction only rarely match the problem area precisely, resulting in solutions that are obscured by the need for support …

    lund Repository record for Techniques for implementing embedded domain specific languages in dynamic languages (opens in a new tab) Download PDF for Techniques for implementing embedded domain specific languages in dynamic languages (opens in a new tab)

  3. Bidirectional Programming Languages

    … dissertation presents bidirectional programming languages, which provide an elegant and effective mechanism for describing updatable views. Unlike programs written in an ordinary language, which only work in one direction, programs in a bidirectional language can be run both forwards and …

    penn Repository record for Bidirectional Programming Languages (opens in a new tab)

  4. Editing composed languages

    The development of domain-specific languages and the migration of legacy software have long been problems for which language composition offers an enticing solution. Unfortunately, approaches thus far have failed to meet expectations, largely due to the difficulty of writing composed programs. …

    kings Repository record for Editing composed languages (opens in a new tab) Download PDF for Editing composed languages (opens in a new tab)

  5. Understanding Dead Languages

    Dead languages present a case where the original language community no longer exists. This results in a language for which the evidence is limited by the paucity of surviving texts and in which no new linguistic uses can be generated. Ludwig Wittgenstein argued that the meaning of language is …

    vt Repository record for Understanding Dead Languages (opens in a new tab)

  6. Stuttering in signed languages

    Little is known about stuttering in signed languages. Although disfluencies are known to occur in deaf users of signed languages, there has been little research suggesting that these disfluencies can be termed "stuttering". Because signed language studies is an emerging field and there are many …

    texas Repository record for Stuttering in signed languages (opens in a new tab)

  7. Probabilistic grammars and languages

    … in the theory of probabilistic grammars and languages. First, the relationship of branching processes to probabilistic context-free grammars is investigated. Second, a method is given for finding probabilities of certain strings in context-free languages given "regular-like" expressions …

    ut-knoxville Repository record for Probabilistic grammars and languages (opens in a new tab)

  8. Implementing categorical programming languages

    … specification and construction of programming languages is increasing, there is still a considerable gap between categorical definition and what is needed to specify and implement a programming language. A categorical framework is needed to organize different computational settings uniformly. …

    utk-theses Repository record for Implementing categorical programming languages (opens in a new tab)

  9. Chaucer's Languages of Love

    No abstract prepared.

    texas-state Repository record for Chaucer's Languages of Love (opens in a new tab)

  10. Reducibilities between Regular Languages

    … is whether it holds for every two regular languages that they are comparable under the given reduction. For the first reducibility, it is shown that any two polynomial sized regular sets are comparable and every polynomial sized regular set is reducible to every exponential sized regular …

    nus Repository record for Reducibilities between Regular Languages (opens in a new tab) Download file for Reducibilities between Regular Languages (opens in a new tab)

  11. Duolects: Cooperatively Constructed Languages

    … community-level structures (eg. communitarian languages) determine the shared resources that make our experiences intelligible. Contra Fricker, I argue that individuals do control some resources that make an experience intelligible to others, since the resources we use to communicate are …

    anu Repository record for Duolects: Cooperatively Constructed Languages (opens in a new tab)

  12. Framework-Specific Modeling Languages

    Framework-specific modeling languages (FSMLs) help developers build applications based on object-oriented frameworks. FSMLs formalize abstractions and rules of the framework's application programming interfaces (APIs) and can express models of how applications use an API. Such models, referred to …

    waterloo Repository record for Framework-Specific Modeling Languages (opens in a new tab)

  13. The EPP across Languages

    … geographically, and genetically diverse languages. I define the EPP as the obligatory movement of some element into the inflectional domain, and argue that the EPP can vary in three different dimensions: (i) whether an argument or a predicate is the goal of the EPP-probe, (ii) whether the …

    toronto-retro Repository record for The EPP across Languages (opens in a new tab)

  14. Number in classifier languages

    Classifier languages are often described as lacking genuine number morphology and treating all common nouns, including those conceptually count, as an unindividuated mass. This study argues that neither of these popular assumptions is true, and presents new generalizations and analyses gained by …

    umn Repository record for Number in classifier languages (opens in a new tab)

  15. Interacting with functional languages

    Functional languages are mathematically pure, and easier to reason about than their imperative rivals. Because of this, they are an attractive paradigm of programming. They allow programmers to express complex algorithms in a declarative manner, resulting in powerful programs that are also well …

    glasgow Repository record for Interacting with functional languages (opens in a new tab) Download PDF for Interacting with functional languages (opens in a new tab)

  16. Overview of Computer Languages

    As everybody knows, computer languages are basically divided as; 1. Low Level 2 . High Level In this paper we will concentrate on high level languages such as Fortran, Prolog, Small Talk.

    marquette Repository record for Overview of Computer Languages (opens in a new tab)

  17. Fourth Generation Programming Languages.

    … and the failure of older generations of languages, such as COBOL, PL/ I, PASCAL, etc., to keep up with this increased demand, there exists a need for new techniques and approaches to programming. Greater programmer /user productivity and enhanced user friendliness, to allow more end users …

    nps Repository record for Fourth Generation Programming Languages. (opens in a new tab)

  18. The multidimensional forest languages

    … regular forest grammars define a class of string languages for each value of n;One-dimensional forest grammars yield exactly the regular languages. Two dimensional forest grammars yield all the context-free languages and perhaps some non-context-free languages which can be produced without copying …

    iastate Repository record for The multidimensional forest languages (opens in a new tab)

Page 1 of 977