A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

Casas, Amadeo; Cabeza, Daniel; Hermenegildo, Manuel V.

doi:10.1007/11737414_11

Cited by 24 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To simplify notation, we include sequences of terms (Seq(T )) as part of T . 3 We also assume some standard definitions and operations on terms: termFn(x) denotes the (name, arity) of the term, args : T → Seq(T ) obtains the term arguments (i.e., the sequence of children), and setArgs : T × Seq(T ) → T replaces the arguments of a term.…”

Section: Language Extensions As Translation Rulesmentioning

confidence: 99%

See 1 more Smart Citation

Modular Extensions for Modular (Logic) Languages

Morales

Hermenegildo

Haemmerlé³

2012

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. We address the problem of developing mechanisms for easily implementing modular extensions to modular (logic) languages. By (language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our use of the concept of modularity in this context is twofold. We would like these extensions to be modular, in the sense above, i.e., we should be able to develop different extensions mostly separately. At the same time, the sources and targets for the extensions are modular languages, i.e., such extensions may take as input separate pieces of code and also produce separate pieces of code. Dealing with this double requirement involves interesting challenges to ensure that modularity is not broken: first, combinations of extensions (as if they were a single extension) must be given a precise meaning. Also, the separate translation of multiple sources (as if they were a single source) must be feasible. We present a detailed description of a code expansion-based framework that proposes novel solutions for these problems. We argue that the approach, while implemented for Ciao, can be adapted for other Prolog-based systems and languages.

show abstract

Section: Language Extensions As Translation Rulesmentioning

confidence: 99%

“…For example, consider embedding a simple handy functional notation [3] (syntactic sugar to write goals, marked with~, in term positions), into a more complex extension, such as the Prologbased implementation of CHR [8]. In this new dialect, the CHR rule (see Sect.…”

Section: Introductionmentioning

confidence: 99%

Modular Extensions for Modular (Logic) Languages

Morales

Hermenegildo

Haemmerlé³

2012

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…FibFun is the result of parallelizing a definition of the Fibonacci numbers written using the functional notation capabilities of Ciao [6]. Because of the order in which code is generated in the (automatic) translation into Prolog, the result is only parallelizable by UOUDG and UUDG, hence the speedup obtained in this case.…”

Section: Performance Evaluationmentioning

confidence: 99%

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Casas

Carro

Hermenegildo

2008

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to generate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

show abstract

“…Note the use of higher order in list.of. More details on Ciao's functional notation can be found in [21]. Logic Programmíng Flavors: a set of packages (which are loaded by default when a Prolog module is read in) provide support for full ISO-Prolog and a number of other classical "builtins" expected by users to be provided by Prolog systems -except that of course in Ciao rather than builtins all of them are optional features brought in from the libraries.…”

Section: ?-Use_package(functional) ?-[321] = ~Nrev(x)mentioning

confidence: 99%

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Hermenegildo¹,

Bueno²,

Carro³

et al. 2008

Concurrency, Graphs and Models

Self Cite

View full text Add to dashboard Cite

Abstract. We describe some of the novel aspects and motivations behind the design and implementation of the Ciao multiparadigm programming system. An important aspect of Ciao is that it provides the programmer with a large number of useful features from different programming paradigms and styles, and that the use of each of these features can be turned on and off at will for each program module. Thus, a given module may be using e.g. higher order functions and constraints, while another module may be using objects, predicates, and concurrency. Furthermore, the language is designed to be extensible in a simple and modular way. Another important aspect of Ciao is its programming environment, which provides a powerful preprocessor (with an associated assertion language) capable of statically finding non-trivial bugs, verifying that programs comply with specifications, and performing many types of program optimizations. Such optimizations produce code that is highly competitive with other dynamic languages or, when the highest levéis of optimization are used, even that of static languages, all while retaining the interactive development environment of a dynamic language. The environment also includes a powerful auto-documenter. The paper provides an informal overview of the language and program development environment. It aims at illustrating the design philosophy rather than at being exhaustive, which would be impossible in the format of a paper, pointing instead to the existing literature on the system.

show abstract

A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems

Cited by 24 publications

References 17 publications

Modular Extensions for Modular (Logic) Languages

Modular Extensions for Modular (Logic) Languages

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Contact Info

Product

Resources

About