Downloads & Free Reading Options - Results

The authors propose new variation of relative set abstraction as an extension to a lambdacalculus based functional language. This feature interacts orthogonally with the standard functional language capabilities, yet provides the full expressive power of first-order Horn-logic programming, as well as a very useful subset of higher-order Horn-logic programming. This resulting language lends itself to efficient interpretation, in that complete operational procedures are possible without computationally expensive primitives such as higher-order unification, unification relative to an equational theory, or general theorem-proving.

The authors propose new variation of relative set abstraction as an extension to a lambdacalculus based functional language. This feature interacts orthogonally with the standard functional language capabilities, yet provides the full expressive power of first-order Horn-logic programming, as well as a very useful subset of higher-order Horn-logic programming. This resulting language lends itself to efficient interpretation, in that complete operational procedures are possible without computationally expensive primitives such as higher-order unification, unification relative to an equational theory, or general theorem-proving.

The authors propose new variation of relative set abstraction as an extension to a lambdacalculus based functional language. This feature interacts orthogonally with the standard functional language capabilities, yet provides the full expressive power of first-order Horn-logic programming, as well as a very useful subset of higher-order Horn-logic programming. This resulting language lends itself to efficient interpretation, in that complete operational procedures are possible without computationally expensive primitives such as higher-order unification, unification relative to an equational theory, or general theorem-proving.

Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings Author: Herbert Kuchen, Kazunori Ueda Published by Springer Berlin Heidelberg ISBN: 978-3-540-41739-2 DOI: 10.1007/3-540-44716-4 Table of Contents: The Metalanguage λprolog and Its Implementation A Scalable Architecture for Proof-Carrying Code Parameterized Logic Programs where Computing Meets Learning Proving Syntactic Properties of Exceptions in an Ordered Logical Framework A Higher-Order Colon Translation Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine A Higher-Order Logic Programming Language with Constraints Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog ‐ A Case-study ‐ An Effective Bottom-Up Semantics for First-Order Linear Logic Programs A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs Adding Linear Constraints over Real Numbers to Curry A Complete Selection Function for Lazy Conditional Narrowing An Abstract Machine Based System for a Lazy Narrowing Calculus Incremental Learning of Functional Logic Programs A General Type Inference Framework for Hindley/Milner Style Systems Monadic Encapsulation with Stack of Regions Well-Typed Logic Programs Are not Wrong A Framework for Analysis of Typed Logic Programs Abstract Compilation for Sharing Analysis

Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings Author: Herbert Kuchen, Kazunori Ueda Published by Springer Berlin Heidelberg ISBN: 978-3-540-41739-2 DOI: 10.1007/3-540-44716-4 Table of Contents: The Metalanguage λprolog and Its Implementation A Scalable Architecture for Proof-Carrying Code Parameterized Logic Programs where Computing Meets Learning Proving Syntactic Properties of Exceptions in an Ordered Logical Framework A Higher-Order Colon Translation Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine A Higher-Order Logic Programming Language with Constraints Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog ‐ A Case-study ‐ An Effective Bottom-Up Semantics for First-Order Linear Logic Programs A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs Adding Linear Constraints over Real Numbers to Curry A Complete Selection Function for Lazy Conditional Narrowing An Abstract Machine Based System for a Lazy Narrowing Calculus Incremental Learning of Functional Logic Programs A General Type Inference Framework for Hindley/Milner Style Systems Monadic Encapsulation with Stack of Regions Well-Typed Logic Programs Are not Wrong A Framework for Analysis of Typed Logic Programs Abstract Compilation for Sharing Analysis

Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings Author: Herbert Kuchen, Kazunori Ueda Published by Springer Berlin Heidelberg ISBN: 978-3-540-41739-2 DOI: 10.1007/3-540-44716-4 Table of Contents: The Metalanguage λprolog and Its Implementation A Scalable Architecture for Proof-Carrying Code Parameterized Logic Programs where Computing Meets Learning Proving Syntactic Properties of Exceptions in an Ordered Logical Framework A Higher-Order Colon Translation Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine A Higher-Order Logic Programming Language with Constraints Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog ‐ A Case-study ‐ An Effective Bottom-Up Semantics for First-Order Linear Logic Programs A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs Adding Linear Constraints over Real Numbers to Curry A Complete Selection Function for Lazy Conditional Narrowing An Abstract Machine Based System for a Lazy Narrowing Calculus Incremental Learning of Functional Logic Programs A General Type Inference Framework for Hindley/Milner Style Systems Monadic Encapsulation with Stack of Regions Well-Typed Logic Programs Are not Wrong A Framework for Analysis of Typed Logic Programs Abstract Compilation for Sharing Analysis

x, 389 p. : 24 cm

x, 389 p. : 24 cm

x, 389 p. : 24 cm

Two programming paradigms, logic programming and functional programming, are discussed in detail with emphasis on the particular advantages and disadvantages of each paradigm. The integration of these two programming paradigms is explored based on the notion that declarative sorts of knowledge (facts and logical relationships) should be expressed in a declarative way, and that procedural sorts of knowledge (manipulation, control, and utilization of knowledge) should be expressed in a procedural way. Toward this end, the conceptual framework for an integrated language is established, and the basic features of the language are outlined. (Author)

Critical missions require the guarantees provided through formal verification and functional programming. This provides a strong basis for decisions that must be assured in a contested cyber environment. We present a framework for educating future cyber leaders on these important concepts and tools.

Available from National Technical Information Service, Springfield, Va

Functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CS's) as programs in order to define non-strict non-determi-nistic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some properties---mainly compositionality---that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a singular denotational semantics, while run-time choice induces a plural semantics. We have discovered that this latter identification is wrong when pattern matching is involved, and thus we propose two novel compositional plural semantics for CS's that are different from run-time choice. We study the basic properties of our plural semantics---compositionality, polarity, monotonicity for substitutions, and a restricted form of the bubbling property for constructor systems---and the relation between them and to previous proposals, concluding that these semantics form a hierarchy in the sense of set inclusion of the set of computed values. We have also identified a class of programs characterized by a syntactic criterion for which the proposed plural semantics behave the same, and a program transformation that can be used to simulate one of them by term rewriting. At the practical level, we study how to use the expressive capabilities of these semantics for improving the declarative flavour of programs. We also propose a language which combines call-time choice and our plural semantics, that we have implemented in Maude. The resulting interpreter is employed to test several significant examples showing the capabilities of the combined semantics. To appear in Theory and Practice of Logic Programming (TPLP)

Functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CS's) as programs in order to define non-strict non-determi-nistic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some properties---mainly compositionality---that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a singular denotational semantics, while run-time choice induces a plural semantics. We have discovered that this latter identification is wrong when pattern matching is involved, and thus we propose two novel compositional plural semantics for CS's that are different from run-time choice. We study the basic properties of our plural semantics---compositionality, polarity, monotonicity for substitutions, and a restricted form of the bubbling property for constructor systems---and the relation between them and to previous proposals, concluding that these semantics form a hierarchy in the sense of set inclusion of the set of computed values. We have also identified a class of programs characterized by a syntactic criterion for which the proposed plural semantics behave the same, and a program transformation that can be used to simulate one of them by term rewriting. At the practical level, we study how to use the expressive capabilities of these semantics for improving the declarative flavour of programs. We also propose a language which combines call-time choice and our plural semantics, that we have implemented in Maude. The resulting interpreter is employed to test several significant examples showing the capabilities of the combined semantics. To appear in Theory and Practice of Logic Programming (TPLP)

The authors propose a new approach to the integration of functional and logic languages, based on a theory of unification and set valued functions. A set-valued function maps a tuple of input sets into an output set. This document a language called Setlog illustrates this approach, and gives its model-theoretic, fixed-point, and operational semantics. The model-theoretic semantics and fixed-point semantics resemble that of Horn logic. The operational semantics uses outermost reduction (for set-valued functions) and unification (for terms). The correctness of the operational semantics is established through soundness and completeness proofs. Keywords: Syntax; Set theory.