| |
Browse All Reviews > Software (D) > Programming Languages (D.3) > Language Constructs and Features (D.3.3) > Procedures, Functions, And Subroutines (D.3.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 11
Reviews about "Procedures, Functions, And Subroutines (D.3.3...)":
|
Date Reviewed |
| |
Programmer’s ultimate security deskref
Foster J., Syngress Publishing, 2004. Type: Book (9781932266726)
As networked communication becomes the norm in the information era, securing information and ensuring secure communications have become increasingly vital, yet difficult to fulfill, tasks. While device-oriented solutions--such...
|
Feb 14 2005 |
| |
Converting call-by-reference to call-by-value: Fortran and Lisp coexisting
Fateman R., Toy R. Symbolic and algebraic computation (Proceedings of the 2003 international symposium, Philadelphia, PA, USA, Aug 3-6, 2003) 95-102, 2003. Type: Proceedings
Users of computer algebra systems may observe that the built-in numeric facilities of such systems are in some ways inferior to those that can be found in the extensive and highly sophisticated Fortran libraries. Linking Fortran subrou...
|
Jan 26 2004 |
| |
Interprocedural may-alias analysis for pointers: beyond k-limiting
Deutsch A. ACM SIGPLAN Notices 29(6): 230-241, 1994. Type: Article
Deutsch reports on methods for alias analysis of recursive pointer data structures. The paper is meant for advanced programmers who work on important jobs like programming language implementation, compiler construction, and operating s...
|
Aug 1 1995 |
| |
Precise executable interprocedural slices
Binkley D. ACM Letters on Programming Languages and Systems 2(1-4): 31-45, 1993. Type: Article
A program slice describes all the statements of the program affecting a given variable x at a given point p. Interprocedural slicing, in which a slice crosses the boundaries of the procedure calls,...
|
May 1 1995 |
| |
On the conversion of indirect to direct recursion
Kaser O., Ramakrishnan C., Pawagi S. ACM Letters on Programming Languages and Systems 2(1-4): 151-164, 1993. Type: Article
Inline expansion replaces a call to a procedure with the procedure’s body. Inline expansion, among other benefits, eliminates procedure call overhead and improves addressing locality. Recursion presents a problem, since a rec...
|
May 1 1995 |
| |
Efficient call graph analysis
Hall M., Kennedy K. ACM Letters on Programming Languages and Systems 1(3): 227-242, 1992. Type: Article
According to the authors, “most compilers optimize procedures as separate units” and do not take into account the possibility of global optimization. The paper considers this question and examines previous attempts ...
|
Jan 1 1994 |
| |
Parameter transmission abstractions
Jokinen M. The Computer Journal 33(2): 133-139, 1990. Type: Article
Jokinen refers to the technique described here as a linguistic mechanism; it is used to define hidden actions like copying, type conversions, or assigning default values to optional parameters as part of parameter transmissions resulti...
|
Jun 1 1991 |
| |
The usefulness of standard functions in Modula-2: an example in relation to VDI
So . Journal of Pascal, Ada & Modula-2 6(1): 5-9, 1987. Type: Article
...
|
Dec 1 1988 |
| |
On the algebraic definition of programming languages
Broy M., Wirsing M., Pepper P. ACM Transactions on Programming Languages and Systems 9(1): 54-99, 1987. Type: Article
One of the important developments of the 1970s was the development of the idea of the algebraic specification languages through the work of Goguen, Guttag, and Zilles, just to name a few of the contributors. This paper is a development...
|
Aug 1 1987 |
| |
Routines: an argument against the conventional approach to functions and procedures
Middleton A. Software--Practice & Experience 16(2): 119-130, 1986. Type: Article
This paper provides an argument for a generalized “routine” which embraces both the concepts of “function” and “procedure.” The suggestion is that a multipurpose “ro...
|
Dec 1 1986 |
| |
|
|
| |
|
|
