Implementing a notion of modules in the logic programming language λProlog

Kwon, Keehang; Nadathur, Gopalan; Wilson, Debra Sue

doi:10.1007/3-540-56454-3_18

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With this paper we have tried to contribute to filling this gap, and has motivated our decision of developing a study of programs structuring and modularity in a higher-order logical and semantics framework with constraints useful in real declarative systems like T OY, Curry (http://www-i2.informatik.uni-kiel.de/ curry/) or the Teyjus implementation (http://teyjus.cs.umn.edu/) of the higher-order logic programming language λProlog [24].…”

Section: Introductionmentioning

confidence: 99%

A modular semantics for higher-order declarative programming with constraints

Vírseda

Morente

2011

Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming

View full text Add to dashboard Cite

Modularity is a key issue in the construction of large multiparadigm declarative programs involving complex features like higher-order, polymorphism or constraints. The modular framework defined in this paper for higher-order declarative constraint programming builds complex software systems by combining and composing existing components or modules from a number of composition operations expressive enough to model typical modularization issues like export/import relationships and inheritance. The effectiveness of our approach relies on a higher-order constraint rewriting logic over a parametrically given constraint domain as the basis of a model-theoretic and fixpoint semantics for program modules, and a modular semantics given by a suitable immediate consequence operator which is compositional and fully abstract, offering the possibility of reasoning on the composition process itself. The availability of this well-founded semantics characterization for structuring and modularizing higher-order declarative constraint programs provides the ground to perform sound semantics-based transformation, analysis, debugging and verification of declarative software.

show abstract

Section: Introductionmentioning

confidence: 99%

A modular semantics for higher-order declarative programming with constraints

Vírseda

Morente

2011

Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming

View full text Add to dashboard Cite

show abstract

A proposal for modules in λProlog

Miller

1994

Extensions of Logic Programming

View full text Add to dashboard Cite

Abstract. Higher-order hereditary Harrop formulas, the underlying logical foundation of AProlog [NM88], are more expressive than first-order Horn clauses, the logical foundation of Prolog. In particular, various forms of scoping and abstraction are supported by the logic of higherorder hereditary Harrop formulas while they are not supported by firstorder Horn clauses. Various papers have argued that the scoping and abstraction available in this richer logic can be used to provide for modular programming [MilS9b], abstract data types [Mi189a], and state encapsulation [HM90]. None of these papers, however, have dealt with the problems of programming-in-the-large, that is, the essentially linguistic problems of putting together various different textual sources of code found, say, in different files on a persistent store into one logic program. In this paper, I propose a module system for AProlog and shall focus mostly on its static semantics. 1Module syntax should be declarative Several modern programming languages are built on declarative, formal languages: for example, ML and Scheme are based on the A-calculus and Prolog is based on Horn clauses. Initial work on developing such languages was first concerned with programming-in-the-small: problems with programming-in-the-large were attacked later. At that point, a second language was often added on top of the initial language. For example, parsing and compiler directives, such as use, import, include, and local, were added. This second language generally had little connection with the original declarative foundation of the initial language: it was born out of the necessity to build large programs and its function was expediency. The meaning of the resulting hybrid language is often complex since it loses some of its declarative purity. Occasionally, programming design is inflicted with what we may call the "recreating the Turing machine" syndrome. Turing machines were important because they were the first formal system that obviously computed and were clearly easy to implement (at least the bounded version of them). They have not been considered seriously as programming languages for several reasons, inchlding the * An earlier version of this paper was first presented at the 1992 Workshop on AProlog.

show abstract

Implementing a notion of modules in the logic programming language λProlog

Cited by 2 publications

References 6 publications

A modular semantics for higher-order declarative programming with constraints

A modular semantics for higher-order declarative programming with constraints

A proposal for modules in λProlog

Contact Info

Product

Resources

About