Equal rights for functional objects or, the more things change, the more they are the same

ABSTRACT

We argue that intensional object identity in object-oriented programming languages and databases is best defined operationally by side-effect semantics. A corollary is that "functional" objects have extensional semantics. This model of object identity, which is analogous to the normal forms of relational algebra, provides cleaner semantics for the value-transmission operations and built-in primitive equality predicate of a programming language, and eliminates the confusion surrounding "call-by-value" and "call-by-reference" as well as the confusion of multiple equality predicates.Implementation issues are discussed, and this model is shown to have significant performance advantages in persistent, parallel, distributed and multilingual processing environments. This model also provides insight into the "type equivalence" problem of Algol-68, Pascal and Ada.

REFERENCES

• 1: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 2: Serge Abiteboul , Paris C. Kanellakis, Object identity as a query language primitive, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.159-173, June 1989, Portland, Oregon, United States
• 3: AdaLRM: Reference Manual for the Ada® Programming Language. ANSI/MIL-STD-1815A-1983, U.S. Gov't Printing Office, Wash., DC, 1983.
• 4: Norman Adams , Jonathan Rees, Object-oriented programming in scheme, Proceedings of the 1988 ACM conference on LISP and functional programming, p.277-288, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62720]
• 5: Gul Agha, Actors: a model of concurrent computation in distributed systems, MIT Press, Cambridge, MA, 1986
• 6: Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 7: Suad Alagic, Object-oriented database programming, Springer-Verlag New York, Inc., New York, NY, 1989
• 8: ANSI-C. Draft Proposed American National Standard Programming Language C. ANSI, New York, 1988.
• 9: Malcolm P. Atkinson , O. Peter Buneman, Types and persistence in database programming languages, ACM Computing Surveys (CSUR), v.19 n.2, p.105-170, June 1987 [doi>10.1145/62070.45066]
• 10: M. P. Atkinson , P. Buneman , R. Morrison, Data types and persistence, Springer-Verlag, London, 1988
• 11: Atkinson, M.P., Bancilhon, F., DeWitt, D., Dittrick, K., Maier, D., and Zdonik, S. "The Object-Oriented Database System Manifesto". Proc. First Deductive and Object-Oriented Database Conf., Kyoto, Japan, Dec. 1989.
• 12: Autodesk. AutoLISP® Release 10 Programmer's Reference. TD111-05.2, Autodesk, Inc., Sausalito, CA, 1988.
• 13: John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
• 14: Henry C. Baker, Jr. , Carl Hewitt, The incremental garbage collection of processes, Proceedings of the 1977 symposium on Artificial intelligence and programming languages, p.55-59, August 15-17, 1977
• 15: Henry G. Baker, Jr., List processing in real time on a serial computer, Communications of the ACM, v.21 n.4, p.280-294, April 1978 [doi>10.1145/359460.359470]
• 16: Henry G. Baker, A source of redundant identifiers in PASCAL programs, ACM SIGPLAN Notices, v.15 n.2, p.14-16, February 1980 [doi>10.1145/947586.947587]
• 17: Henry G. Baker, Unify and conquer, Proceedings of the 1990 ACM conference on LISP and functional programming, p.218-226, June 27-29, 1990, Nice, France [doi>10.1145/91556.91652]
• 18: Henry G. Baker, Efficient implementation of bit-vector operation in Common Lisp, ACM SIGPLAN Lisp Pointers, v.III n.2-4, p.8-22, April-June 1990 [doi>10.1145/121989.121991]
• 19: Baker90d: Baker, Henry. "The Nimble Type Inferencer for Common Lisp-84". Tech. Rept., Nimble Comp., 1990.
• 20: Henry G. Baker, Structured programming with limited private types in Ada: nesting if for the soaring eagles, ACM SIGAda Ada Letters, v.XI n.5, p.79-90, July/August 1991 [doi>10.1145/122215.122219]
• 21: Henry G. Baker, Shallow binding makes functional arrays fast, ACM SIGPLAN Notices, v.26 n.8, p.145-147, Aug. 1991 [doi>10.1145/122598.122614]
• 22: Henry G. Baker, Object-oriented programming in Ada83—genericity rehabilitated, ACM SIGAda Ada Letters, v.XI n.9, p.116-127, Nov./Dec. 1991 [doi>10.1145/122012.122018]
• 23: Henry G. Baker, CONS should not CONS its arguments, or, a lazy alloc is a smart alloc, ACM SIGPLAN Notices, v.27 n.3, p.24-34, March 1992 [doi>10.1145/130854.130858]
• 24: Henry G. Baker, The buried binding and dead binding problems of Lisp 1.5: sources of incomparability in garbage collector measurements, ACM SIGPLAN Lisp Pointers, v.V n.2, p.11-19, April-June 1992 [doi>10.1145/1039991.1039993]
• 25: Bawden, A. Pure Scheme emulation of cells from network mail ckca 1988. Obtained from M. Felleisen.
• 26: R. S. Bird, Tabulation Techniques for Recursive Programs, ACM Computing Surveys (CSUR), v.12 n.4, p.403-417, Dec. 1980 [doi>10.1145/356827.356831]
• 27: Bloom, Toby. "Immutable Groupings". CLU Design Note 61, MIT LCS, Aug. 16, 1976.
• 28: Adrienne Bloss, Update analysis and the efficient implementation of functional aggregates, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.26-38, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99373]
• 29: F. W. Burton, A note on higher-order functions versus logical variables, Information Processing Letters, v.31 n.2, p.91-95, April 26, 1989 [doi>10.1016/0020-0190(89)90074-4]
• 30: Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
• 31: Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
• 32: Cohen, J.M., and Cohen, M.J. The Penguin Dictionary of Quotations. Penguin Books, Middlesex, England, 1960.
• 33: Cointe, Pierre. "Metaclasses are First Class: the ObjVlisp Model". Proc. OOPSLA '87, Sigplan Notices 22, 12 (Dec. 1987), 156-167.
• 34: Digitalk Inc. Smalltalk/V 286 Tutorial and Programming Handbook. Digitalk, Inc., Los Angeles, CA, 1988.
• 35: DoD. "STEELMAN": Department of Defense Requirements for High Order Computer Programming Languages, June 1978.
• 36: Ershov, A.P. "On Programming of Arithmetic Operations". Doklady, AN USSR 118, 3 (1958), 427-430, transl. Friedman, M.D., CACM 1, 8 (Aug. 1958), 3-6.
• 37: Richard P. Gabriel , John McCarthy, Queue-based multi-processing LISP, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.25-44, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802019]
• 38: Gabriel, R.P. "The Why of Y". ACM Lisp Pointers 2, 2 (Oct.-Dec. 1988), 15-25.
• 39: David K. Gifford , John M. Lucassen, Integrating functional and imperative programming, Proceedings of the 1986 ACM conference on LISP and functional programming, p.28-38, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319848]
• 40: Adele Goldberg , David Robson, Smalltalk-80: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
• 41: Goto, E. "Monocopy and Associative Algorithms in an Extended Lisp". Univ. of Tokyo, May 1974.
• 42: Goto, E., and Kanada, Y. "Recursive Hashed Data Structures with Applications to Polynomial Manipulations". SYMSAC 76.
• 43: Nicolas Graube, Reflexive Architecture: From ObjVLisp to CLOS, Proceedings of the European Conference on Object-Oriented Programming, p.110-127, August 15-17, 1988
• 44: Gunn, H.I.E., and Morrison, R. "On the Implementation of Constants". Info. Proc. Let. 9, 1 (1979), 1-4.
• 45: John Guttag, Abstract data types and the development of data structures, Communications of the ACM, v.20 n.6, p.396-404, June 1977 [doi>10.1145/359605.359618]
• 46: Robert H. Halstead, Jr., Implementation of multilisp: Lisp on a multiprocessor, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.9-17, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802017]
• 47: Robert H. Halstead, Jr., MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.501-538, Oct. 1985 [doi>10.1145/4472.4478]
• 48: Harper, R., et al. "Standard ML". Tech. Rept. ECS-LFCS-86-2, Comp. Sci. Dept., Edinburgh, UK, March, 1986.
• 49: L. Harrison, Parcel: project for the automatic restructuring and concurrent evaluation of LISP, Proceedings of the 2nd international conference on Supercomputing, p.527-538, June 1988, St. Malo, France [doi>10.1145/55364.55416]
• 50: Maurice P. Herlihy , Barbara Liskov, A Value Transmission Method for Abstract Data Types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.4, p.527-551, Oct. 1982 [doi>10.1145/69622.357182]
• 51: Russell Atkinson , Carl Hewitt, Synchronization in actor systems, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.267-280, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512975]
• 52: Hewitt, Carl E., and Baker, Henry. "Actors and Continuous Functionals". Proc. IFIP Working Conf. on Formal Descr. of Progr. Concepts, Aug. 1977, in Neuhold, Erich eed., Formal Description of Programming Concepts. North-Holland, Amsterdam, 1978, 367-390.
• 53: Hilden, J. "Elimination of Recursive Calls using a Small Table of 'Randomly' Selected Function Values". BIT 16 (1978), 60-73.
• 54: W. Daniel Hillis, The connection machine, MIT Press, Cambridge, MA, 1989
• 55: Paul Hudak , Adrienne Bloss, The aggregate update problem in functional programming systems, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.300-314, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318660]
• 56: Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
• 57: Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989 [doi>10.1145/72551.72554]
• 58: Hughes, G.E., and Cresswell, M.J. An Introduction to Modal Logic. Methuen and Co., London, 1968.
• 59: John Hughes, Lazy memo-functions, Proc. of a conference on Functional programming languages and computer architecture, p.129-146, January 1985, Nancy, France
• 60: Kahan, W. "Branch Cuts for Complex Elementary Functions, or Much Ado about Nothing's Sign Bit". Proc. Jt. IMA/SIAM Conf. on The State of the Art in Numerical Analysis, U. Birmingham, April 1986, Iserles, A., and Powell, M.J.D., Eds., Clarendon Press, Oxford, 1987.
• 61: Kale, L.V. "The Chare Kernel Parallel Programming System". Int'l. Conf. on Parallel Programming, Aug. 1990.
• 62: Katz, Morris J. ParaTran: A Transparent, Transaction Based Runtime Mechanism for Parallel Execution of Scheme. M.S. Thesis, MIT, Camb., MA, June 1986.
• 63: Keller, R.M., and Lindstrom, G. "Toward Function-Based Distributed Database Systems". Tech. Rep. 82-100, Dept. of Computer Sci., U. Utah, Jan. 1982, 37p.
• 64: Kent, William. "A rigorous model of object reference, identity, and existence". J. O.-O. Progr., (June 1991), 28-36.
• 65: Setrag N. Khoshafian , George P. Copeland, Object identity, ACM SIGPLAN Notices, v.21 n.11, p.406-416, Nov. 1986
• 66: Won Kim , Frederick H. Lochovsky, Object-oriented concepts, databases, and applications, ACM Press/Addison-Wesley Publishing Co., New York, NY, 1989
• 67: King, Roger. "My Cat is Object-Oriented". in [Kim89], 23-30.
• 68: Andrei V. Klimov, Dynamic specialization in extended functional language with monotone objects, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.199-210, June 17-19, 1991, New Haven, Connecticut, United States
• 69: Tom Knight, An architecture for mostly functional languages, Proceedings of the 1986 ACM conference on LISP and functional programming, p.105-112, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319854]
• 70: Norman Adams , David Kranz , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin, ORBIT: an optimizing compiler for scheme, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.219-233, June 25-27, 1986, Palo Alto, California, United States
• 71: Krasner, Glenn, ed. Smalltalk-80: Bits of History, Words of Advice. Addison-Wesley, Reading, MA, 1983.
• 72: David A. Lamb , Paul Hilfinger, Simulation of Procedure Variables Using Ada Tasks, IEEE Transactions on Software Engineering, v.9 n.1, p.13-15, January 1983 [doi>10.1109/TSE.1983.236165]
• 73: Kevin J. Lang , Barak A. Pearlmutter, Oaklisp: an object-oriented scheme with first class types, ACM SIGPLAN Notices, v.21 n.11, p.30-37, Nov. 1986
• 74: James Richard Larus , Paul Hifinger, Restructuring symbolic programs for concurrent execution on multiprocessors, University of California, Berkeley, 1989
• 75: Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983 [doi>10.1145/358141.358147]
• 76: Henry Lieberman, Using prototypical objects to implement shared behavior in object-oriented systems, Conference proceedings on Object-oriented programming systems, languages and applications, p.214-223, September 29-October 02, 1986, Portland, Oregon, United States
• 77: Barbara Liskov , Alan Snyder , Russell Atkinson , Craig Schaffert, Abstraction mechanisms in CLU, Communications of the ACM, v.20 n.8, p.564-576, Aug. 1977 [doi>10.1145/359763.359789]
• 78: Lomet, David B. "Objects and Values: The Basis of a Storage Model for Procedural Languages". IBM J. Res. & Dev. 20, 2 (March 1976), 157-167.
• 79: Lucassen, John M. Types and Effects: Towards the Integration of Functional and Imperative Programming. Ph.D. Thesis, also MIT/LCS/TR-408, MIT, 1987, 153p.
• 80: Peter Lyngbaek , Victor Vianu, Mapping a semantic database model to the relational model, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.132-142, May 27-29, 1987, San Francisco, California, United States
• 81: B. J. MacLennan, Values and objects in programming languages, ACM SIGPLAN Notices, v.17 n.12, December 1982 [doi>10.1145/988164.988172]
• 82: Bruce J. MacLennan, A simple software environment based on objects and relations, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.199-207, June 25-28, 1985, Seattle, Washington, United States
• 83: David Maier , Jacob Stein , Allen Otis , Alan Purdy, Development of an object-oriented DBMS, ACM SIGPLAN Notices, v.21 n.11, p.472-482, Nov. 1986
• 84: Ian A. Mason, The semantics of destructive LISP, Center for the Study of Language and Information, Stanford, CA, 1987
• 85: John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
• 86: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 87: Milner, Robin. "A Theory of Type Polymorphism in Programming". JCSS 17 (1978), 348-375.
• 88: John C. Mitchell , Gordon D. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.470-502, July 1988 [doi>10.1145/44501.45065]
• 89: Moon, David A. MacLisp Reference Manual, Rev. 0. Proj. MAC, MIT, April 1974.
• 90: David A. Moon, The Common LISP object-oriented programming language standard, Object-oriented concepts, databases, and applications, ACM, New York, NY, 1989 [doi>10.1145/63320.66471]
• 91: Morris, J.H. Lambda-Calculus Models of Programming Languages. Ph.D. Thesis, MIT, 1968.
• 92: Moses, Joel. "The Function of FUNCTION in Lisp". Memo 199, MIT AI Lab., Camb., MA, June 1970.
• 93: Mostow, J., and Cohen, D. "Automating Program Speedup by Deciding What to Cache". Proc. IJCAI-85, L.A., CA, Aug. 1985, 165-172.
• 94: Gordon S. Novak, Jr., Data abstraction in GLISP, Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, p.170-177, June 27-29, 1983, San Francisco, California, United States
• 95: Atsushi Ohori , Peter Buneman , Val Breazu-Tannen, Database programming in Machiavelli—a polymorphic language with static type inference, ACM SIGMOD Record, v.18 n.2, p.46-57, June 1989
• 96: Atushi Ohori, Representing object identity in a pure functional language, Proceedings of the third international conference on database theory on Database theory, p.41-55, November 1990, Paris, France
• 97: Pacini, G., and Simi, M. "Testing Equality in Lisp-like Environments". BIT 18 (1978), 334-341.
• 98: Padget, Julian, and Nuyens, Greg. The EuLisp Definition, Version 0.6. Univ. of Bath, Bath, Eng., July, 1989.
• 99: Plotkin, G.D. "Call-by-name, call-by-value, and the lambda-calculus". Theor. Comput. Sci. 1 (1975), 125-159.
• 100: Pratt, V.R. "Process Logic". ACM POPL 6, (1979), 93-100.
• 101: William Pugh, An improved replacement strategy for function caching, Proceedings of the 1988 ACM conference on LISP and functional programming, p.269-276, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62719]
• 102: Christian Queinnec , Pierre Cointe, An open-ended data representation model for EU_LISP, Proceedings of the 1988 ACM conference on LISP and functional programming, p.298-308, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62722]
• 103: George Radin, The early history and characteristics of PL/I, ACM SIGPLAN Notices, v.13 n.8, p.227-241, August 1978 [doi>10.1145/960118.808389]
• 104: J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
• 105: Robinson, J.A., and Sibert, E.E. "LOGLISP: Motivation, Design, and Implementation". In Clark, K.L., and Tamlund (eds), Logic Programming, Academic Press, 1982, 299-314.
• 106: Erik Ruf , Daniel Weise, Nondeterminism and unification in LogScheme: integrating logic and functional programming, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.327-339, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99400]
• 107: Sandewall, Erik. "A Proposed Solution to the FUNARG Problem". 6.894 course notes, MIT AI Lab., 1974. This solution was used in the MIT Lisp Machine [Greenblatt].
• 108: Sandewall, Erik. "Ideas about Management of Lisp Data Bases". AI Memo 332, MIT AI Lab., May 1975; also Proc. IJCAI 4 (1975), 585-592.
• 109: Erik Sandewall, Programming in an Interactive Environment: the ``Lisp'' Experience, ACM Computing Surveys (CSUR), v.10 n.1, p.35-71, March 1978 [doi>10.1145/356715.356719]
• 110: Schwartz, J. T. "Optimization of very high level languages-I. Value transmission and its corollaries". J. Computer Lang. 1 (1975), 161-194.
• 111: Schwartz, J.T. "Optimization of very high level languages--II. Deducing relationships of inclusion and membership". J. Computer Lang. 1, 3 (1975), 197-218.
• 112: Alan Snyder, Encapsulation and inheritance in object-oriented programming languages, Conference proceedings on Object-oriented programming systems, languages and applications, p.38-45, September 29-October 02, 1986, Portland, Oregon, United States
• 113: Guy L. Steele, Jr., Rabbit: A Compiler for Scheme, Massachusetts Institute of Technology, Cambridge, MA, 1978
• 114: Guy L. Steele, Jr. , W. Daniel Hillis, Connection Machine Lisp: fine-grained parallel symbolic processing, Proceedings of the 1986 ACM conference on LISP and functional programming, p.279-297, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319870]
• 115: Steele, G.L. "Fast Arithmetic in Maclisp". Proc. 1977 Macsyma User's Conf., NASA Sci. and Tech. Info. Off. (Wash., DC, July 1977), 215-224. Also AI Memo 421, MIT AI Lab., Camb., MA.
• 116: Guy L Steele , Gerald J Sussman, The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two), Massachusetts Institute of Technology, Cambridge, MA, 1978
• 117: Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984
• 118: Guy Steele, Common Lisp: The Language, Digital Press, Newton, MA, 1990
• 119: Bjarne Stroustrup, The C++ programming language, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 120: Mark Swanson , Robert Kessler , Gary Lindstrom, An implementation of portable standard LISP on the BBN butterfly, Proceedings of the 1988 ACM conference on LISP and functional programming, p.132-142, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62694]
• 121: Daniel C. Swinehart , Polle T. Zellweger , Richard J. Beach , Robert B. Hagmann, A structural view of the Cedar programming environment, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.4, p.419-490, Oct. 1986 [doi>10.1145/6465.6466]
• 122: Teitelman, Warren. Interlisp Reference Manual. Xerox Palo Alto Research Center, 1974.
• 123: Teitelman, W., and Masinter, L. "The Interlisp programming environment". Computer 14, 4 (Apr. 1981), 25-34.
• 124: Pete Tinker , Morry Katz, Parallel execution of sequential scheme with ParaTran, Proceedings of the 1988 ACM conference on LISP and functional programming, p.28-39, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62682]
• 125: Turner, D.A. "A new implementation technique for applicative languages". SW--Pract. & Exper. 9 (1979), 31-49.
• 126: Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983
• 127: David Ungar , Randall B. Smith, Self: The power of simplicity, ACM SIGPLAN Notices, v.22 n.12, p.227-242, Dec. 1987
• 128: van Wijngaarden, A., et al. "Revised Report on the Algorithmic Language Algol 68". ACM Sigplan Not. 12, 5 (May 1977), 1-70.
• 129: Verity, J.W., and Schwartz, E.I. "Software Made Simple-Will Object-Oriented Programming Transform the Computer Industry?". Business Week cover story, Sept. 30, 1991, 92-100.
• 130: Victor Vianu, A dynamic framework for object projection views, ACM Transactions on Database Systems (TODS), v.13 n.1, p.1-22, March 1988 [doi>10.1145/42201.42202]
• 131: David H D Warren , Luis M. Pereira , Fernando Pereira, Prolog - the language and its implementation compared with Lisp, Proceedings of the 1977 symposium on Artificial intelligence and programming languages, p.109-115, August 15-17, 1977
• 132: Ben Wegbreit, The treatment of data types in EL1, Communications of the ACM, v.17 n.5, p.251-264, May 1974 [doi>10.1145/360980.360992]
• 133: Welsh, J., et al. "Ambiguities and insecurities in Pascal". SW-Prac. & Exper. 7, 6 (1977), 685-696.
• 134: Wiebe, Douglas. "A Distributed Repository for Immutable Persistent Objects". Proc. OOPSLA'86, Sigplan Not. 21, 11 (Nov. 1986), 453-465.
• 135: David S. Wise, Matrix algebra and applicative programming, Proc. of a conference on Functional programming languages and computer architecture, p.134-153, October 1987, Portland, Oregon, United States
• 136: W. A. Wulf , D. B. Russell , A. N. Habermann, BLISS: a language for systems programming, Communications of the ACM, v.14 n.12, p.780-790, Dec. 1971 [doi>10.1145/362919.362936]
• 137: Young, J.W.A., ed. Monographs on Topics of Modern Mathematics Relevant to the Elementary Field. Longmans, Green & Co., 1911. Reprinted by Dover Publications, 1955.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.3 PROGRAMMING LANGUAGES

General Terms:
Design, Languages, Performance, Theory