We follow the set-based approach to directional types proposed by Aiken and Lakshman [1]. their type checking algorithm works via set constraint solving and is sound and complete for given discriminative types. We cha...
详细信息
ISBN:
(纸本)3540650148
We follow the set-based approach to directional types proposed by Aiken and Lakshman [1]. their type checking algorithm works via set constraint solving and is sound and complete for given discriminative types. We characterize directional types in model-theoretic terms. We present an algorithm for inferring directional types. the directional type that we derive from a logic program P is uniformly at least as precise as any discriminative directional type of P, i.e., any directional type out of the class for which the type checking algorithm of Aiken and Lakshman is sound and complete. We improve their algorithm as well as their lower bound and thereby settle the complexity (DEXPTIME-complete) of the corresponding problem.
It is important that practical data flow analysers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract do...
详细信息
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Four-valued diagnoses for stratified knowledge-bases;on the subject reduction property for alge...
ISBN:
(纸本)3540631720
the proceedings contain 28 papers. the special focus in this conference is on Computer Science logic. the topics include: Four-valued diagnoses for stratified knowledge-bases;on the subject reduction property for algebraic type systems;bounded-variable fixpoint queries are PSPACE-complete;graph rewriting semantics for functionalprogramming languages;an extension of models of axiomatic domain theory to models of synthetic domain theory;relative undecidability in term rewriting;extending models of second order predicate logic to models of second order dependent type theory;cut-free display calculi for relation algebras;computational aspects of arity hierarchies;weak semantics based on lighted button pressing experiments;monadic NP and built-in trees;optimization problems with approximation schemes;computational representations of herbrand models using grammars;social confluence in client-server systems;a type-free resource-aware a-calculus;inductive definitions with decidable atomic formulas;new intuitionistic logical constants and undecidability of the conservativeness problem.
We describe a definitional approach to the combination of functional and logicprogramming based on the theory of Partial Inductive Definitions. the described method produces programs directly executable in the defini...
详细信息
the proceedings contain 21 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Semantics of constraint logic programs with bounded quantifiers;translating a modal la...
ISBN:
(纸本)9783540609834
the proceedings contain 21 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Semantics of constraint logic programs with bounded quantifiers;translating a modal language with embedded implication into horn clause logic;pruning the search space of logic programs;a significant extension of logicprogramming by adapting model building rules;efficient resource management for linear logic proof search;a logic language based on GAMMA-like multiset rewriting;handling equality in logicprogramming via basic folding;an abstract machine for reasoning about situations, actions, and causality;on the computational complexity of propositional logic programs with nested implications;proof-theory for extensions of logicprogramming;a fibrational semantics for logic programs;language and implementation;a new framework for declarative programming;extending constructive negation for partial functions in lazy functional-logic languages;total correctness of logic programs;a declarative semantics for the prolog cut operator;a definitional approach to functionallogicprogramming;soundness and completeness of non-classical extended SLD-resolution and some postulates for nonmonotonic theory revision applied to logicprogramming.
the proceedings contain 22 papers. the special focus in this conference is on logicprogramming and Term Rewriting. the topics include: Toward the concurrent implementation of computational systems;logicprogramming o...
ISBN:
(纸本)3540617353
the proceedings contain 22 papers. the special focus in this conference is on logicprogramming and Term Rewriting. the topics include: Toward the concurrent implementation of computational systems;logicprogramming on negation as instantiation;independence in dynamically scheduled logic languages;heterogeneous constraint solving;a hierarchy of semantics for normal constraint logic programs;order-sorted termination;unravelings and ultra-properties;standardization theorem revisited;discrete normalization and standardization in deterministic residual structures;a language for the logical specification of processes and relations;a process algebra for synchronous concurrent constraint programming;an algebraic approach to mixins and modularity;a strict border for the decidability of e-unification for recursive functions;prime factorizations of abstract domains using first order logic;abstractions of uniform proofs;complementing logic program semantics;meaningless terms in rewriting;unique normal form property of higher-order rewriting systems;algebraic semantics for functionallogicprogramming with polymorphic order-sorted types;specifying type systems and the semantic treatment of polymorphic specification languages.
We introduce a new semantics for logicprogramming languages. It generalises the traditional Herbrand universe semantics, and specialises the semantics of logical relations, as used in analysing parametricity in funct...
详细信息
In this paper, we present a high-level implementation of lazy functionallogic programs by transforming them into Prolog programs. the transformation is controlled by generalized definitional trees which specify the n...
详细信息
In this paper we present the semantics of a functionallogic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriti...
详细信息
暂无评论