
	Where results make sense

Topic: Generic programming

Related Topics

Programming language

Functional programming

Programming paradigm

D programming language

C programming language

C Sharp programming language

Procedural programming

Ada programming language

Standard Template Library

Halting problem

Data structure

List of articles with C programs

Software componentry

Parameter (computer science)

Computer memory

In the News (Fri 25 Jul 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	The PacSoft WWW Server
		Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters.
		In contrast with normal programs, the parameters of a generic programs are often quite rich in structure.
		Recent developments in functional and object-oriented programming lead the organizers of this workshop to believe that there is sufficient interest to warrant the organisation of a one-day workshop on the theme of generic programming.
	www.cse.ogi.edu /PacSoft/conf/wgp (1672 words)

	Generic Programming
		This process, called lifting, is repeated until the generic algorithm has reached a suitable level of abstraction, where it provides maximal reusability while still yielding efficient, concrete implementations.
		When the Generic Programming process is carefully followed, the concepts that emerge tend to describe the abstractions within the problem domain in some logical way.
		Thus, the output of the Generic Programming process is not just a generic, reusable implementation, but a better understanding of the problem domain.
	www.generic-programming.org (299 words)

	Generics
		Generics provides a way for you to communicate the type of a collection to the compiler, so that it can be checked.
		Generics are implemented by type erasure: generic type information is present only at compile time, after which it is erased by the compiler.
		It is straightforward to use a generic library, but it requires some expertise to write a generic library, or to generify an existing library.
	java.sun.com /j2se/1.5.0/docs/guide/language/generics.html (739 words)

	Generic Programming Techniques (Site not responding. Last check: 2007-09-10)
		This is an incomplete survey of some of the generic programming techniques used in the boost libraries.
		Generic programming is about generalizing software components so that they can be easily reused in a wide variety of situations.
		An object generator may be more useful than a plain constructor when the exact type to be generated is difficult or impossible to express and the result of the generator can be passed directly to a function rather than stored in a variable.
	www.boost.org /more/generic_programming.html (1393 words)

	Generic Haskell meetings
		The compiler generates a specific instance of the type indexed function for each type that is used as type index used in an application of the type indexed function.
		A generic program is a program that works on values of a large class of data types (or DTD's, schemas, structures, class hierarchies).
		Generic Haskell is a superset of Haskell 98 designed specifically for generic programming, adding a number of new features to the Haskell language such as type-indexed values, kind-indexed types and type-indexed types.
	www.cs.uu.nl /research/projects/generic-haskell/talks.html (2500 words)

	Generic Programming Resources [Guntram Berti, TU Cottbus]
		Generic programming is a technique aiming at writing programs as general as possible, without sacrificing efficiency by doing overgeneralization.
		A standardized generic interface for traversing graphs is of utmost importance to encourage reuse of graph algorithms and data structures.
		BGL provides some general purpose graph classes that conform to this interface, but they are not meant to be the ``only'' graph classes; there certainly will be other graph classes better for certain situations.
	www.math.tu-cottbus.de /~berti/research/generic.html (983 words)

	Datatype-Generic Programming
		This school is a successor to the Summer School and Workshop on Generic Programming, held in Oxford in August 2002 (lecture notes appeared as volume 2793 of LNCS).
		A severe drawback of these approaches is that generic functions, once defined, cannot be extended with ad-hoc behaviour for new data types, precluding the design of a customizable generic programming library based on the se techniques.
		Moreover, datatype-generic programming is a precisely-defined notion with a rigorous mathematical foundation, in contrast to generic programming in general and the C++ template mechanism in particular, and thereby offers the prospect of better static checking and a greater ability to reason about generic programs.
	web.comlab.ox.ac.uk /oucl/research/pdt/ap/dgp (1193 words)

	Generic Programming in C# and .NET 2.0
		A generic class in C# is one whose underlying data type (or types) is abstract.
		A generic class is in fact a type and instantiating a type results in a class.
		Generic programming complements and improves on traditional object-oriented technology by allowing developers to create highly reusable, robust and extendible software systems.
	www.datasim.nl /education/coursedetails.asp?coursecategory=CS&coursecode=CSGEN (311 words)

	Dr. Dobb's Journal Interview with Alex Stepanov
		One of the things that is central to generic programming as I understand it now, is that complexity, or at least some general notion of complexity, has to be associated with an operation.
		In one sense, generic programming is a natural continuation of the fundamental ideas of object-oriented programming---separating the interface and implementation and polymorphic behavior of the components.
		I think that generic programming can influence language research and that we will have practical languages, which are easy to use and are well suited for that style of programming.
	www.sgi.com /tech/stl/drdobbs-interview.html (6688 words)

	Algebra of Programming Research Group: Topics
		Generic programs are polymorphic, but typically in a wider sense than the traditional one.
		A generic program might be parameterized by a richer structure, such as a type constructor (eg lists vs trees), another program (as in component-oriented programming), or even a programming paradigm (eg functional vs relational programming).
		A theory of generic programming will clearly be very flexible and powerful; the problem that we are trying to address is to control this flexibility without overly restricting its use, yielding a disciplined theory of meta-programming.
	web.comlab.ox.ac.uk /oucl/research/pdt/ap/topics.html (870 words)

	Modern C++ Design: Generic Programming and Design Patterns Applied - $43.99 (Site not responding. Last check: 2007-09-10)
		Fundamentally, it demonstrates ‘generic patterns’ or ‘pattern templates’ as a powerful new way of creating extensible designs in C++–a new way to combine templates and patterns that you may never have dreamt was possible, but is. If your work involves C++ design and coding, you should read this book.
		Generic components enable an easier and more seamless transition from design to application code, generate code that better expresses the original design intention, and support the reuse of design structures with minimal recoding.
		Generic programming is a paradigm that focuses on abstracting types to a narrow collection of functional requirements and on implementing algorithms in terms of these requirements.
	www.awprofessional.com /title/0201704315 (2312 words)

	Generic Programming and the STL: Using and Extending the C++ Standard Template Library - $47.99 (Site not responding. Last check: 2007-09-10)
		Generic Programming and the STL explains the central ideas underlying generic programming--concepts, modeling, and refinement--and shows how these ideas lead to the fundamental concepts of the STL: iterators, containers, and function objects.
		Generic programming, unlike object-oriented programming, does not require you to call functions through extra levels of indirection; it allows you to write a fully general and reusable algorithm that is just as efficient as an algorithm handcrafted for a specific data type.
		A generic algorithm is written by abstracting algorithms on specific types and specific data structures so that they apply to arguments whose types are as general as possible.
	www.awprofessional.com /title/0201309564 (2929 words)

	Algorithm Library Design: Lecture Notes: STL and Generic Programming
		Generic programming is a sub-discipline of computer science that deals with finding abstract representations of efficient algorithms, data structures, and other software concepts, and with their systematic organization.
		The goal of generic programming is to express algorithms and data structures in a broadly adaptable, interoperable form that allows their direct use in software construction.
		Lifting of a concrete algorithm to as general a level as possible without losing efficiency; i.e., the most abstract form such that when specialized back to the concrete case the result is just as efficient as the original algorithm.
	www.mpi-sb.mpg.de /~kettner/courses/lib_design_03/notes/stl.html (3176 words)

	Java Programming: Section 12.1 (Site not responding. Last check: 2007-09-10)
		To get some perspective on generic programming in general, it might be useful to look very briefly at generic programming in two other languages.
		However, generic programming in Java is closer in spirit to Smalltalk than it is to C++.
		Iterators can seem rather strange to someone who is encountering generic programming for the first time, but you should understand that they solve a difficult problem in an elegant way.
	www.roseindia.net /javajdktutorials/c12/s1.shtml (4393 words)

	[No title]
		In C++/CLI, this is introduced with either the generic keyword, if you choose the common language runtime (CLR) generic mechanism, or the template keyword, if you choose to use the C++ template type mechanism, as shown in Figure 1.
		The generic definition is more like a blueprint; the runtime constructs the type-specific instances, modifying the general syntax based on whether the type argument is a reference or value type.
		In the literature describing generics, the class generation is referred to as constructionâ”this again follows from the distinction between a template and a blueprint.
	msdn.microsoft.com /msdnmag/issues/05/04/PureC (2249 words)

	The Problem with .NET Generics - OSNews.com
		Generics promise to increase type safety, improve performance, reduce code duplication and eliminate unnessecary casts.
		Some people might think that generic arithmetic types are a fringe application, but everytime you draw a line using System.Drawing you use types such as Point and PointF that could benefit from a generic implementation.
		Another area where generic arithmetic types are important is the very large field of numerical programming, including mundane types such as vectors and matrices as well as more esoteric types like complex numbers and quaternions.
	www.osnews.com /story.php?news_id=7930 (719 words)

	Book Guide - Generic Programming and the STL (Site not responding. Last check: 2007-09-10)
		The STL is an example of the generic programming paradigm.
		It is a collection of predefined class and function templates, but it is also a collection of "concepts" that specify how the STL components collaborate and how the STL can be extended.
		Generic Programming and the STL is unique because of the approach it takes in describing the STL in terms of "concepts."
	archive.devx.com /free/books/bookview.asp?content_id=1335 (184 words)

	Amazon.com: Generic Programming and the STL: Using and Extending the C++ Standard Template Library: Books: Matthew H. ... (Site not responding. Last check: 2007-09-10)
		Exploring the idea of a generic algorithm leads naturally to the central ideas of concepts, modeling, and refinement, ideas that are as basic to generic programming as polymorphism and inheritance are to object-oriented programming.
		The approach taken by generic programming can be very abstract, but it is extremely powerful, and one that allows generality and economy of thought in programming.
		Readers with a background in mathematical logic are referred to the references for a discussion of the connection between concepts and the theory of many-sorted algebras.
	www.amazon.com /Generic-Programming-STL-Extending-Standard/dp/0201309564 (4602 words)

	[No title]
		The generic member definitions of the class template are never used (nor are they cross-checked) to create the definitions for the members of an explicit specialization.
		The general rule is that when class template partial specializations are declared, the compiler chooses the template definition that is the most specialized for the instantiation.
		The generic definitions for the members of a class template are never used to instantiate the members of the class template partial specialization.
	msdn.microsoft.com /msdnmag/issues/05/08/PureC/default.aspx (2875 words)

	Generic Programming Resources
		I am as anxious to learn more about generic programming as I am to promote it.
		I was introduced to Generic Programming by Oleg Zabluda (you will see his name in some of the books on the market for Generic Programming and STL).
		The C++ Programming Language The must have book for all C++ Programmers, written by the creator of C++.
	www.netwaysglobal.com /genericprogramming (397 words)

	Generic Programming in C
		The idea is that you can apply a general algorithm to a chunk of data, regardless of the specifics of the operation you want to apply to the data and even without regard to the type of data itself.
		However, what a lot of programmers don't appreciate is that you can use a similar style of programming in C. In fact, a couple of the C runtime library functions, qsort and bsearch already use this style - the functions are general algorithms that can apply to arbitrary data using a user specified comparison method.
		As you can see from the implementation of for_each, using generic programming in C is not without a cost.
	www.btinternet.com /~aescleal/Programming_files/GenericInC.htm (718 words)

	Templates and Generic Programming for STL
		The Standard Template Library (STL) is a collection of generic fundamental computing data structures (or containers of data), mechanisms to access and manipulate data contained in these containers and algorithms that can be applied to these data structures.
		In method (or function) overloading, the compiler can determine the implementation that needs to be executed from the type of the arguments passed to the function call.
		The following program performs the same operation as the one in the previous example but it uses a generic function instead of overloaded functions.
	www.codersource.net /published/view/324/templates_and_generic_programming_for_stl.aspx (497 words)

	Generic Programming Is Better
		I have not found generics in general or C++ templates in particular to be very advantageous.
		It often requires quite a bit of programmer effort to force a class to work with a template and often the amount of work to adapt the class is equal to or exceeds the amount of value provided by the template.
		Implementing generics in C++ can be a pain, and I dislike the design of templates in C++, but the advantages to the users of genericized services is vast and undeniable.
	c2.com /cgi/wiki?GenericProgrammingIsBetter (1232 words)

	Generic Programming In Smalltalk
		In its more advanced uses, generic programming allows you to compose behaviors without using adapters all over the place.
		We all know the problems with dynamic type-checking; it is hard to optimize dynamically type-checked programs and many errors that could be detected at compile-time in other languages must be detected at run-time in a dynamically typed language.
		So, the problem is NOT making generics for Smalltalk so that it can be more powerful, the problem is how to make a type system for Smalltalk that can give the benefits of static typing without losing the benefits of dynamic typing.
	c2.com /cgi/wiki?GenericProgrammingInSmalltalk (1193 words)

	Scrap your boilerplate: a practical approach to generic programming (Site not responding. Last check: 2007-09-10)
		The "scrap your boilerplate" approach to generic programming allows the programmer to generic functions that can traverse arbitrary data structures, and yet have type-specific cases.
		Such programs often have a great deal of "boilerplate" code that simply walks the structure, hiding a small amount of "real" code that constitutes the reason for the traversal.
		These generic programs are much more robust to data structure evolution because they contain many fewer lines of type-specific code.
	research.microsoft.com /~simonpj/papers/hmap (428 words)

Try your search on: Qwika (all wikis)