Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Enumeration operators and modular logic programming
Journal of Logic Programming
A type discipline for Program modules
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Handbook of theoretical computer science (vol. B)
A calculus for the construction of modular Prolog programs
Journal of Logic Programming
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
The Go¨del programming language
The Go¨del programming language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully abstract compositional semantics for an algebra of logic programs
Theoretical Computer Science
A unified computation model for functional and logic programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Implementing a Notion of Modules in the Logic Programming Language Lambda-Prolog
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Composing programs in a rewriting logic for declarative programming
Theory and Practice of Logic Programming
A logic programming approach to the verification of functional-logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
On modular transformation of structural content
Proceedings of the 2004 ACM symposium on Document engineering
A practical type analysis for verification of modular prolog programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A higher-order demand-driven narrowing calculus with definitional trees
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Cooperation of algebraic constraint domains in higher-order functional and logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
Modularity is a key issue in the construction of large multi-paradigm 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.