Sökning: "definitional reflection"

Hittade 2 avhandlingar innehållade orden definitional reflection.

  1. 1. 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

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