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 68 for “"Denotational semantics"”.

  1. Executable Denotational Semantics With Interaction Trees

    Interaction trees are a representation of effectful and reactive systemsdesigned to be implemented in a proof assistant such as Coq. They are equipped with a rich algebra of combinators to construct recursive and effectful computations and to reason about them equationally. Interaction trees are …

    penn Repository record for Executable Denotational Semantics With Interaction Trees (opens in a new tab)

  2. Denotational Semantics of Mobility in Unifying Theories of Programming (UTP)

    … and has been used successfully for giving denotational semantics to Imperative Programming, CSP process algebra, and the Circus family of programming languages, amongst others. In this thesis, we present an extension of UTP-CSP (the UTP semantics for CSP) with the concept of mobility. …

    whiterose Download PDF for Denotational Semantics of Mobility in Unifying Theories of Programming (UTP) (opens in a new tab)

  3. Techniques for Modelling Structured Operational and Denotational Semantics Definitions with Term Rewriting Systems

    … support for program verification is that the semantics of programs be appropriately formalized using the object language underlying the proof tool. This means that the semantics definition must not only be stated as syntactically correct input for the proof tool to be used, but also in such a …

    cau-kiel Repository record for Techniques for Modelling Structured Operational and Denotational Semantics Definitions with Term Rewriting Systems (opens in a new tab)

  4. Non-symmetric completion as a topological foundation for denotational semantics, the complexity analysis of programs, and Russell-Wiener' s theory of continuous-time

    … and parallel composition, thus bridging semantics-sensitive reasoning with classical time and space complexity classes. In parallel, a unified model of continuous time is developed, grounded in event structures and oriented quasi-uniformities of past and future. By leveraging both the …

    greece Repository record for Non-symmetric completion as a topological foundation for denotational semantics, the complexity analysis of programs, and Russell-Wiener' s theory of continuous-time (opens in a new tab)

  5. Concurrent semantics for probabilistic and quantum languages

    … can be used to furnish concurrent languages with denotational semantics. Event structures are studied in three distinct settings: non-deterministic, probabilistic, and quantum computation. Based on these three realms, we successively extend a core imperative-like concurrent language with …

    minho-thes Repository record for Concurrent semantics for probabilistic and quantum languages (opens in a new tab)

  6. Comparative Studies, Formal Semantics and PVS Encoding of CSP#

    … extension) from the perspectives of operational semantics and verification capabilities together with eight benchmark systems. These comparisons provide insights for users to select suitable languages/tools for various concurrent systems. <br><br> CSP# operational semantics has been defined and …

    nus Repository record for Comparative Studies, Formal Semantics and PVS Encoding of CSP# (opens in a new tab) Download file for Comparative Studies, Formal Semantics and PVS Encoding of CSP# (opens in a new tab)

  7. Easel: an indefinite computing language

    … a functional language, Easel, with declarative denotational semantics similar to human mathematical discourse. Practical advantages of this include established methods of representation and analysis. Well-founded Easel programs have denotational semantics, the formal analog of the informal …

    ttu Repository record for Easel: an indefinite computing language (opens in a new tab)

  8. Quillen model structures, *-autonomous categories and adherence spaces

    … traditions have evolved around linear logic: the denotational semantics of linear logic, and the Geometry of Interaction. In this thesis we explore how abstract homotopy theory may be used to reconcile these semantic traditions. This approach is in some sense already suggested by the fact that, in …

    ottawa-retro Repository record for Quillen model structures, *-autonomous categories and adherence spaces (opens in a new tab)

  9. Completely iterative monads in semantics of coinductive programs

    … tackles the problem of mathematical description (denotational semantics) of the observable behaviour of such programs.</p> <p>In the tradition of denotational semantics and functional programming, one can distinguish between pure computations, which are regarded as mathematical functions, and …

    oxford Repository record for Completely iterative monads in semantics of coinductive programs (opens in a new tab)

  10. Translating Temporal SQL to Nested SQL

    Sequenced and nonsequenced semantics are the two previously researched semantics for the evaluation of an operation in a temporal database such as a query or data modification. Sequenced semantics evaluates an operation in each time instant using only the data alive at that time. Nonsequenced …

    utahstate Repository record for Translating Temporal SQL to Nested SQL (opens in a new tab)

  11. OPTIMIZATION OF FUNCTIONAL PROGRAMS

    … of functional programs allows effective use of denotational semantics techniques. The same analysis shows a method for implementation as parallel computations using message sending protocols. Networks of distributed processors can be designed in a straightforward way from these results.

    rice Repository record for OPTIMIZATION OF FUNCTIONAL PROGRAMS (opens in a new tab)

  12. Python interpretatoriaus, palaikančio kategorinį tipą, realizacija /

    … on lambda calculus, functional programming, and denotational semantics. It discusses the relationship between Cartesian Closed Categories (CCC) and lambda calculus, highlighting how category theory methods help formally describe the constructs of functional programming languages. The primary …

    vilnius Repository record for Python interpretatoriaus, palaikančio kategorinį tipą, realizacija / (opens in a new tab)

  13. Python interpretatoriaus, palaikančio kategorinį tipą, realizacija /

    … on lambda calculus, functional programming, and denotational semantics. It discusses the relationship between Cartesian Closed Categories (CCC) and lambda calculus, highlighting how category theory methods help formally describe the constructs of functional programming languages. The primary …

    vilnius Repository record for Python interpretatoriaus, palaikančio kategorinį tipą, realizacija / (opens in a new tab)

  14. Interaction Trees and Formal Specifications

    … Trees are a recently developed form of denotational semantics for effectful programsthat is executable and compositional. This dissertation uses Interaction Trees to develop reusable, language-independent tools for different classes of specifications. First, it demonstrates how to apply …

    penn Repository record for Interaction Trees and Formal Specifications (opens in a new tab)

  15. A Reflexive Graph Model of Sized Types

    … contribution is a relationally parametric denotational semantics for λST in the form of a reflexive graph model. In this model, sizes are irrelevant: they do not affect the result of any computations. The calculus and model are fully formalised in Agda (without sized types).

    chalmers Repository record for A Reflexive Graph Model of Sized Types (opens in a new tab)

  16. Modular Compilers and Their Correctness Proofs

    … Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are …

    uiuc Repository record for Modular Compilers and Their Correctness Proofs (opens in a new tab)

Page 1 of 4