Sökning: "programming logics"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden programming logics.

1. 1. Samtida konst på bästa sändningstid : Konst i svensk television 1956–1969

   Författare :David Rynell Åhlén; Anna Dahlgren; Jeff Werner; Jesper Olsson; Stockholms universitet; []
   Nyckelord :HUMANIORA; HUMANITIES; Television; modern art; Sweden; arts programming; mediatization; remediation; cultural history of television genres; Sveriges Radio; Kristian Romare; Lennart Ehrenborg; Torbjörn Axelman; Moderna Museet; Multikonst; konstvetenskap; Art History;

   Sammanfattning : This dissertation investigates the mediation of art on Swedish television during the 1950s and 1960s. The aim is to examine how the new medium of television was put to use in the dissemination and promotion of contemporary and modernist art during this time. LÄS MER

3. 2. Generic Programming with Concepts

   Författare :Marcin Zalewski; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; libraries; c ; concepts; generic; template;

   Sammanfattning : Generic programming is an indispensable ingredient of modern programminglanguages. In the C++ programming language, generic programming isimplemented by the means of parameterized fragments of code, called templates,in which parameters are constrained by concepts. LÄS MER

4. 3. Computational Issues in Calculi of Partial Inductive Definitions

   Författare :Per Kreuger; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

   Sammanfattning : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. LÄS MER

5. 4. Relations in Dependent Type Theory

   Författare :Carlos Gonzalía; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formalized mathematics; relational systems; category theory; programming logics; constructive type theory; logical frameworks; relational database model;

   Sammanfattning : This thesis investigates how to express and reason about relational concepts and methods inside the constructive logical framework of Martin-Löf's monomorphic type theory. We cover several areas where the notion of relation is central, and show how to formalize the basic concepts of each area. LÄS MER

7. 5. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction

   Författare :Tarmo Uustalu; KTH; []
   Nyckelord :;

   Sammanfattning : This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicate-valued operators on predicate transformers that send monotone predicate transformers to their least and greatest fixedpoints, predicates being quasiordered by inclusion. LÄS MER