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 17 of 17 for “"Programming Language Semantics"”.

  1. An Argument against Gradual Type Systems in Programming Language Semantics

    … integrates static and dynamic typing in a single programming language. This allows the programmer to statically or dynamically type portions of their code at will, which offers more flexibility than languages that require all code to be statically typed. Despite the added convenience, gradual …

    lmu Repository record for An Argument against Gradual Type Systems in Programming Language Semantics (opens in a new tab)

  2. Atlantis : a tool for language definition and interpreter synthesis.

    Programming language semantics are usually defined informally in some form of technical natural language, or in a very mathematical manner with techniques such as the Vienna Definition Method (VDM) or denotational semantics. One difficulty which arises from serious attempts to define language …

    adelaide Repository record for Atlantis : a tool for language definition and interpreter synthesis. (opens in a new tab)

  3. Applications of a natural deduction set theory

    … been chosen as the area of mathematics, while programming language semantics and semantics for the lambda calculus are the areas of computer science. In each of the three areas NaDSet provides a logical foundation using exactly the same "logistic" method: Basic concepts are defined as terms of …

    ubc Repository record for Applications of a natural deduction set theory (opens in a new tab) Download PDF for Applications of a natural deduction set theory (opens in a new tab)

  4. A Rewriting Logic Approach to Defining Type Systems

    We show how programming language semantics and definitions of their corresponding type systems can both be written in a single framework amenable to proofs of soundness. The framework is based on full rewriting logic (not to be confused with context reduction or term rewriting), where rules can …

    uiuc Repository record for A Rewriting Logic Approach to Defining Type Systems (opens in a new tab)

  5. A comparative study of formalisms for programming language definition : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University

    … of methods for defining the full syntax and semantics of computer programming languages. The syntax, especially the nature of context-dependent conditions in it, is first examined, then some extensions of context-free grammars are compared to see to what extent they can encompass the full …

    massey Repository record for A comparative study of formalisms for programming language definition : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University (opens in a new tab)

  6. A functional database

    <p>This thesis explores the use of functional languages to implement, manipulate and query databases.</p> <p>Implementing databases. A functional language is used to construct a database manager that allows efficient and concurrent access to shared data. In contrast to the locking mechanism found …

    oxford Repository record for A functional database (opens in a new tab)

  7. VRCC-3D+: Qualitative spatial and temporal reasoning in 3 dimensions

    … in Geographic Information Systems (GIS), visual programming language semantics, and digital image analysis. Systems for spatial reasoning over a set of objects have evolved in both expressive power and complexity, but implementations or usages of these systems are not common. This is partially …

    must-thes Repository record for VRCC-3D+: Qualitative spatial and temporal reasoning in 3 dimensions (opens in a new tab)

  8. Away From Linear Models of Concurrent Programs

    Traditional approaches to imperative programming language semantics rely on first defining how each individual statement modifies the memory state, and then composing these definitions into a whole program via the interpretation of the sequential composition operator: the humble semicolon. The …

    kent Download PDF for Away From Linear Models of Concurrent Programs (opens in a new tab)

  9. A modular rewriting approach to language design, evolution and analysis

    … and in safety-critical settings. In response, languages are being defined with support for new domains and complex computational abstractions. The need for formal techniques to help better understand the languages we use, correctly design new language abstractions, and reason about the behavior …

    uiuc Repository record for A modular rewriting approach to language design, evolution and analysis (opens in a new tab)

  10. Choices that make you chnage your mind : a dynamic epistemic logic approach to the semantics of BDI agent programming languages

    … and Artificial Intelligence communities, Agent Programming has been proposed as a paradigm for the development of computer systems. As such, in the last decade, we have seen the flourishing of the literature on Agent Programming with the proposal of several programming languages, e.g. AgentSpeak …

    brazil-ufrgs Repository record for Choices that make you chnage your mind : a dynamic epistemic logic approach to the semantics of BDI agent programming languages (opens in a new tab)

  11. Domain theory in constructive and predicative univalent foundations

    … has applications in a variety of fields, such as programming language semantics, higher-type computability and topology. A common approach to deal with size issues in a predicative foundation is to work with information systems, abstract bases or formal topologies rather than dcpos, and …

    birmingham Download PDF for Domain theory in constructive and predicative univalent foundations (opens in a new tab)

  12. Mechanizing Abstract Interpretation

    … (1) achieving an analyzer design for a given programming language and correctness property; (2) achieving an implementation for the design; and (3) achieving a mechanized verification that the implementation is correct w.r.t. the design. The state of the art in (1) and (2) is to use abstract …

    maryland Repository record for Mechanizing Abstract Interpretation (opens in a new tab)

  13. Runtime Optimization of Contextual Role-oriented Programming Languages

    … Over the past 40 years, role-based modeling and programming have been proposed as a solution to many different technical spaces such as data modeling, framework design, and adaptive software for cyber-physical systems. This thesis deals primarily with role-oriented concepts in programming …

    qucosa-diss

  14. Composable semantics using higher-order attribute grammars

    … new functionality could be added to existing languages incrementally, so that programmers could choose features appropriate to their problem domains, retrieve their specifications, and compose them automatically with an existing host language to generate a compiler for an extended version of …

    umn Repository record for Composable semantics using higher-order attribute grammars (opens in a new tab)

  15. Diagnosing and tolerating bugs in deployed systems

    … reclaiming likely leaked memory. It preserves semantics by waiting until heap exhaustion to reclaim memory--then intercepting program attempts to access reclaimed memory. We demonstrate the utility and efficiency of post-deployment debugging on large, real-world programs--where they pinpoint …

    texas Repository record for Diagnosing and tolerating bugs in deployed systems (opens in a new tab)

  16. Stochastic Dynamic Logics

    We present the semantics of two variants of Probabilistic Propositional DynamicLogic (PPDL). Stochastic Differential Dynamic Logic is a logic for reasoning about hybrid systems with continuous state space that may evolve in contin- uous time according to stochastic differential equations, or in …

    cornell Repository record for Stochastic Dynamic Logics (opens in a new tab)

  17. The programming language TransLucid

    … a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid …

    unsw Repository record for The programming language TransLucid (opens in a new tab)