Sökning: "definitional programming"

Hittade 5 avhandlingar innehållade orden definitional programming.

  1. 1. Definitional program separation

    Författare :Göran Falkman; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; definitional programming; algorithmic form; algorithmic content; higher order programming; definitions; program separation;

    Sammanfattning : .... LÄS MER

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

  4. 3. Issues in Structured Knowledge Representation A Definitional Approach with Application to Case-Based Reasoning and Medical Informatics

    Författare :Göran Falkman; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Several issues concerned with structured knowledge representation based on definitional structures are discussed: the realisation of knowledge-based systems using declarative programming, similarity assessment in knowledge representation and case-based reasoning, and the importance of human-computer interaction and information visualisation in knowledge-based systems. To illustrate the basic ideas, real-world applications from the area of oral medicine are used. LÄS MER

  5. 4. GCLA : the design, use and implementation of a program development system

    Författare :Martin Aronsson; Stockholms universitet; []
    Nyckelord :;

    Sammanfattning : We present a program development system, GCLA (Generalized horn Clause LAnguage*), which is based on a generalization of Horn clauses (e.g. Prolog). This generalization takes a quite different view of the meaning of a logic program - a "definitional" view rather than the traditional logical view. LÄS MER

  7. 5. On Induction, Coinduction and Equality in Martin-Löf and Homotopy Type Theory

    Författare :Andrea Vezzosi; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Conversion; Parametricity; Higher Inductive Types; Sized Types; Dependent Types; Type Theory; Guarded Types;

    Sammanfattning : Martin Löf Type Theory, having put computation at the center of logical reasoning, has been shown to be an effective foundation for proof assistants, with applications both in computer science and constructive mathematics. One ambition though is for MLTT to also double as a practical general purpose programming language. LÄS MER