Polymorphic Programming
This is an excerpt from the paper...
Polymorphic programming is an ideal way in which to approach the problem of developing a filch simulation to address problems involved in creating efficient routing systems for a number of different reasons. While different polymorphic languages each offer slightly different advantages for such a task, in general they all offer those advantages listed below. While the fit between polymorphic languages and routing simulations is a complex one in terms of the details, the overall reason for the good fit is actually quite simple: Polymorphic languages simultaneously offer the (higher-order) complexity and the flexibility that are required to run multiple complex simulations both efficiently and accurately (Lau and Chen 1996).Polymorphic languages are extremely safe in terms of both security issues (such language do not access private fields of access data types, for example). But polymorphic languages are also safe in the sense that they provide greater internal accuracy (such as being able consistently to distinguish integers from pointers). Of even greater importance (both for creating such a simulation as well as
. . .
Some common words found in the essay are:
Dally Seitz, Lau Chen, , Transactions Computers, polymorphic languages, Distributed Systems, Seitz Deadlock-free, Speed Model, languages allow, ieee transactions, Performance Analysis, polymorphic languages allow, Computing September, IEEE Transactions, fit polymorphic languages, lists strings, fit polymorphic, integers lists, networks ieee, lists integers, dally seitz, ieee transactions computers, lists integers lists, transactions computers, networks ieee transactions,
Approximate Word count = 756
Approximate Pages = 3 (250 words per page)
More Essays on Polymorphic Programming
|
Customer Service
to Over
32,000 Professionally Written Papers!!!
