Inductive logicprogramming is a research area which has its roots in machine learning and computational logic. A short introduction to this area is given. It investigates the many faces of inductive logicprogramming...
详细信息
We propose an extension to Definite Horn Clauses by placing partial orders on the bodies of clauses. Such clauses are called relaxable clauses. these partial orders are interpreted as a specification of relaxation cri...
详细信息
Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. the difference involves often only a slight shift of perspective: admitting metavariables into proofs. W...
详细信息
ISBN:
(纸本)9780818643606
Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. the difference involves often only a slight shift of perspective: admitting metavariables into proofs. We propose that such calculi should be implemented in logical frameworks that support this kind of proof construction and that such an implementation can unify program verification and synthesis. the proposal is illustrated with a worked example developed in L.C. Paulson's (1990) Isabelle system. We also give examples of existent calculi that are closely related to the methodology we are proposing and others that can be profitably recast using the approach.< >
the problem of constructing a disjunctive strictness analysis for a higher-order, functional language is addressed. A system of disjunctive types for strictness analysis of typed λ-calculus is introduced, and the typ...
详细信息
ISBN:
(纸本)0818627352
the problem of constructing a disjunctive strictness analysis for a higher-order, functional language is addressed. A system of disjunctive types for strictness analysis of typed λ-calculus is introduced, and the types are used to define a program logic for strictness analysis. A disjunctive abstract interpretation is then obtained as a sound and complete model of the program logic. the results extend earlier work on using the tensor product of lattices to analyze disjunctive properties of programs by abstract interpretation.
Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time sp...
详细信息
ISBN:
(纸本)0818627352
Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time specification. An algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space, is given.
the type and effect discipline, a framework for reconstructing the principal type and the minimal effect of expressions in implicitly typed polymorphic functional languages that support imperative constructs, is intro...
详细信息
ISBN:
(纸本)0818627352
the type and effect discipline, a framework for reconstructing the principal type and the minimal effect of expressions in implicitly typed polymorphic functional languages that support imperative constructs, is introduced. the type and effect discipline outperforms other polymorphic type systems. Just as types abstract collections of concrete values, effects denote imperative operations on regions. Regions abstract sets of possibly aliased memory locations. Effects are used to control type generalization in the presence of imperative constructs while regions delimit observable side effects. the observable effects of an expression range over the regions that are free in its type environment and its type;effects related to local data structures can be discarded during type reconstruction. the type of an expression can be generalized with respect to the variables that are not free in the type environment or in the observable effect.
the proceedings contain 26 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Types, abstraction, and parametric polymorphism, part 2;call-by-valu...
ISBN:
(纸本)9783540555117
the proceedings contain 26 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Types, abstraction, and parametric polymorphism, part 2;call-by-value combinatory logic and the lambda-value calculus;from operational to denotational semantics;a simple language supporting angelic nondeterminism and parallel composition;the equivalence of two semantic definitions for inheritance in object-oriented languages;primitive recursive functional with dependent types;typed homomorphic relations extended with subtypes;information links in domain theory;nonwellfounded sets and programming language semantics;simultaneous substitution in the typed lambda calculus;HSP type theorems in the category of posets;decomposition of domains;cartesian closed categories of domains and the space proj(D);an upper power domain construction in terms of strongly compact sets;correctness of procedure representations in higher-order assembly language;an algorithm for analyzing communicating processes;continuous functions and parallel algorithms on concrete data structures;pomsets and mazurkiewicz traces;on relating concurrency and nondeterminism;on continuous time agents;a monoidal closed category of event structures;an exper model for quest;equations for if-then-else;program correctness and matricial iteration theories;liminf progress measures;and connections.
We present a schematic functionalprogramming language coupled with a logic of programs. Our language allows for μ-recursion, λ-abstraction, nondeterminism and calls to predefined functions. We define a denotational...
详细信息
the proceedings contain 47 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Completeness in approximation classes;separating completely complexity classes rela...
ISBN:
(纸本)9783540514985
the proceedings contain 47 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Completeness in approximation classes;separating completely complexity classes related to polynomial size Ω-decision trees;on product hierarchies of automata;on the communication complexity of planarity;Context-free NCE graph grammars;dynamic data structures with finite population: A combinatorial analysis;iterated deterministic top-down look-ahead;using generating functions to compute concurrency;a logic for nondeterministic functional programs;Complexity classes with complete problems between P and NP-C;decision problems and Coxeter groups;complexity of formula classes in first order logic with functions;normal and sinkless Petri nets;descriptive and computational complexity;the effect of null-chains on the complexity of contact schemes;monte-Carlo inference and its relations to reliable frequency identification;semilinear real-time systolic trellis automata;inducibility of the composition of frontier-to-root tree transformations;on oblivious branching programs of linear length;some time-space bounds for one-tape deterministic turing machines;interpretations of synchronous flowchart schemes;rank of rational finitely generated W-languages;extensional properties of sets of time bounded complexity;learning under uniform distribution;an extended framework for default reasoning;logicprogramming of some mathematical paradoxes;analysis of compact 0-complete trees: A new access method to large databases;representation of recursively enumerable languages using alternating finite tree recognizers;about a family of binary morphisms which stationary words are Sturmian;on the finite degree of ambiguity of finite tree automata;approximation algorithms for channel assignment in cellular radio networks;Generalized Boolean hierarchies and Boolean hierarchies over RP.
Toward the overall goal of putting formal specifications to practical use in the design of Iarge systems, we explore the combination of two specification methods: using temporal logic to specify concurrency properties...
详细信息
暂无评论