chapter

Principles of parameterized programming

Author:

J. A. GoguenAuthors Info & Claims

Software reusability: vol. 1, concepts and models

March 1989

Pages 159 - 225

https://doi.org/10.1145/73103.73110

Published: 01 March 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Zalewski MSchupp SSiek JTip F(2007)C++ concepts as institutionsProceedings of the 2007 Symposium on Library-Centric Software Design10.1145/1512762.1512770(76-87)Online publication date: 21-Oct-2007
https://dl.acm.org/doi/10.1145/1512762.1512770
Veldhuizen TConsel CLawall J(2007)Parsimony principles for software components and metalanguagesProceedings of the 6th international conference on Generative programming and component engineering10.1145/1289971.1289992(115-122)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1145/1289971.1289992
Duggan DTechaubol C(2001)Modular mixin-based inheritance for application frameworksACM SIGPLAN Notices10.1145/504311.50429936:11(223-240)Online publication date: 1-Oct-2001
https://dl.acm.org/doi/10.1145/504311.504299
Show More Cited By

Index Terms

Principles of parameterized programming
1. Software and its engineering
  1. Software creation and management
    1. Software development techniques
      1. Reusability
  2. Software notations and tools
    1. General programming languages
      1. Language features
        Modules / packages
      2. Language types
        Functional languages

Recommendations

Mixed-integer quadratic programming

This paper considers mixed-integer quadratic programs in which the objective function is quadratic in the integer and in the continuous variables, and the constraints are linear in the variables of both types. The generalized Benders' decomposition is a ...
The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method

This article is based on an idea proposed by C. W. Carroll for transforming a mathematical programming problem into a sequence of unconstrained minimization problems. It describes the theoretical validation of Carroll's proposal for the convex ...
On linear programming relaxations for solving polynomial programming problems
Highlights
- Theoretically compared the tightness of the J-set relaxation with the recursive McCormick relaxations.
Abstract
This paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQP) by introducing ...

Comments

Information & Contributors

Information

Published In

Software reusability: vol. 1, concepts and models

March 1989

399 pages

ISBN:0201080176

DOI:10.1145/73103

Editors:
Ted J. Biggerstaff
Microelectronics and Computer Technology Co.
,
Alan J. Perlis
Yale Univ., New Haven, CT

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1989

Permissions

Request permissions for this article.

Request Permissions

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zalewski MSchupp SSiek JTip F(2007)C++ concepts as institutionsProceedings of the 2007 Symposium on Library-Centric Software Design10.1145/1512762.1512770(76-87)Online publication date: 21-Oct-2007
https://dl.acm.org/doi/10.1145/1512762.1512770
Veldhuizen TConsel CLawall J(2007)Parsimony principles for software components and metalanguagesProceedings of the 6th international conference on Generative programming and component engineering10.1145/1289971.1289992(115-122)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1145/1289971.1289992
Duggan DTechaubol C(2001)Modular mixin-based inheritance for application frameworksACM SIGPLAN Notices10.1145/504311.50429936:11(223-240)Online publication date: 1-Oct-2001
https://dl.acm.org/doi/10.1145/504311.504299
Duggan DTechaubol CNorthrop LVlissides J(2001)Modular mixin-based inheritance for application frameworksProceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/504282.504299(223-240)Online publication date: 1-Oct-2001
https://dl.acm.org/doi/10.1145/504282.504299
Clark T(1999)Typechecking UML static modelsProceedings of the 2nd international conference on The unified modeling language: beyond the standard10.5555/1767297.1767350(503-517)Online publication date: 28-Oct-1999
https://dl.acm.org/doi/10.5555/1767297.1767350
Haines M(1997)An open implementation analysis and design for lightweight threadsACM SIGPLAN Notices10.1145/263700.26374032:10(229-242)Online publication date: 9-Oct-1997
https://dl.acm.org/doi/10.1145/263700.263740
Haines MLoomis MBloom T(1997)An open implementation analysis and design for lightweight threadsProceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/263698.263740(229-242)Online publication date: 9-Oct-1997
https://dl.acm.org/doi/10.1145/263698.263740
Maeda CLee AMurphy GKiczales G(1997)Open implementation analysis and designACM SIGSOFT Software Engineering Notes10.1145/258368.25838322:3(44-52)Online publication date: 1-May-1997
https://dl.acm.org/doi/10.1145/258368.258383
Maeda CLee AMurphy GKiczales GClarke LArango G(1997)Open implementation analysis and designProceedings of the 1997 symposium on Software reusability10.1145/258366.258383(44-52)Online publication date: 1-May-1997
https://dl.acm.org/doi/10.1145/258366.258383
Novak G(1997)Software Reuse by Specialization of Generic Procedures through ViewsIEEE Transactions on Software Engineering10.1109/32.60575923:7(401-417)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1109/32.605759
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Mixed-integer quadratic programming

The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method

On linear programming relaxations for solving polynomial programming problems

Comments

Information

Published In

Publisher

Publication History

Permissions

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations