Results 11 
15 of
15
Prological Features In A Functional Setting Axioms And Implementations
 In Third Fuji Int. Symp. on Functional and Logic Programming
, 1998
"... this paper is twofold. First, we show that Prological features ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this paper is twofold. First, we show that Prological features
Implementation of Proof Search in the Imperative Programming Language Pizza
 In Int. Conference TABLEAUX'98, LNAI 1397
, 1998
"... . Automated proof search can be easily implemented in logic programming languages. We demonstrate the technique of success continuations, which provides an equally simple method for encoding proof search in imperative programming languages. This technique is exemplified by developing an interpreter ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. Automated proof search can be easily implemented in logic programming languages. We demonstrate the technique of success continuations, which provides an equally simple method for encoding proof search in imperative programming languages. This technique is exemplified by developing an interpreter for the calculus G4ip in the language Pizza. Keywords: Success Continuations, G4ip, Pizza 1 Introduction A sequentstyle formulation of a logic calculus is a convenient startingpoint for automating proof search because the corresponding inference rules are `local' operations on proofs. A sequent can be proved by applying inference rules until one reaches axioms, or can make no further progress in which case one must backtrack or even abandon the search. This proving method is a simple depthfirst strategy; it is preferred over a less efficient breadthfirst strategy. However, this method requires the mechanism of choice points in order to facilitate the backtracking. Logic programming lan...
Expressive Power of Declarative Programming Languages
, 1998
"... The thesis investigates several aspects of the expressive power of declarative programming languages. There seems to be no widely accepted definition of expressive power of programming languages. In the literature expressiveness may mean power to describe algorithms, or to describe computations, or ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The thesis investigates several aspects of the expressive power of declarative programming languages. There seems to be no widely accepted definition of expressive power of programming languages. In the literature expressiveness may mean power to describe algorithms, or to describe computations, or to check types, etc. Presenting a clearer idea of the expressiveness of programming languages is a part of the aim of the research. We concentrate on the expressive power of declarative languages because these languages are at the highest level of abstraction. People argue about relative expressiveness between declarative languages. Besides, there are two declarative paradigms: logic and functional programming. How can we define and compare expressive power of languages belonging to these two different paradigms ? In order to compare expressive power of logic and functional languages, several translation schemes from subsets of Prolog to Haskell are defined. During the translation we aim to ...
LOGIC PROGRAMMING cum APPLICATIVE PROGRAMMING* ABSTRACT
"... Conditional (directed) equations provid' ~ a paradigm of computation that combines the cl(',, ~ svntax and semantics of both PROLOGlike logic p'rogra~ming and (firstorder) LIsPlike applicative (functional) programming in a uniform manner. For applicative programming, equations are used as conditi ..."
Abstract
 Add to MetaCart
Conditional (directed) equations provid' ~ a paradigm of computation that combines the cl(',, ~ svntax and semantics of both PROLOGlike logic p'rogra~ming and (firstorder) LIsPlike applicative (functional) programming in a uniform manner. For applicative programming, equations are used as conditional rewrite rules; for logic programming, the same equations are employed for "conditional narrowing". Increased expressive power is obtainable by combining both paradigms in one program. 1.
From Interpreter to Logic Engine by
"... Abstract. Starting from a continuationbased interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to ..."
Abstract
 Add to MetaCart
Abstract. Starting from a continuationbased interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambdacalculus. The key transformation here is Reynoldsâ€™s defunctionalization that transforms a tailrecursive, machine. Similar denotational and operational semantics were studied by de Bruin and de Vink (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a directstyle interpreter of propositional Prolog expressed with control operators for delimited continuations. 1