ACM Home Page
Please provide us with feedback. Feedback
MODLISP
Full text PdfPdf (918 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1980 ACM conference on LISP and functional programming table of contents
Stanford University, California, United States
Pages: 65 - 74  
Year of Publication: 1980
Authors
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800087.802791
What is a DOI?

ABSTRACT

This paper discusses the design and implementation of MODLISP, a LISP-like language enhanced with the idea of MODes. This extension permits, but does not require, the user to declare the types of various variables, and to compile functions with the arguments declared to be of a particular type. It is possible to declare several functions of the same name, with arguments of different type (e.g. PLUS could be declared for Integer arguments, or Rational, or Real, or even Polynomial arguments) and the system will apply the correct function for the types of the arguments. The MODLISP language differs from other abstract data type languages such as CLU [Liskov & Zilles, 1974; Liskov et al, 1977] and Russell [Donahue,1977] in that it allows dynamic construction of new parametrised data types and possesses a unified semantics covering interpreted and compiled code, which can call one another at will. In short, it is LISP-like.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ADJ (1978) (Authors: J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright) An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. IBM Research Report RC-6487 (October 1976). Current Trends in Programming Methodology, IV: Data Structuring (R.T. Yeh, Ed.) Prentice Hall, New Jersey (1978) pp. 80-149.
 
2
 
3
Black, A.P. Exception Handling and Data Abstraction. IBM Research Report RC 8059 (1980).
 
4
Cohn, P.M. Universal Algebra. Harper & Row, New York, 1965.
 
5
Cohen, J.D. and Jenks, R.D. On Resolution and Coercion in MODLISP. In preparation.
 
6
Davenport, J.H. and Jenks, R.D. SCRATCHPAD/370 - Modes and Domains (privately circulated).
 
7
 
8
Ershov, A.P. On the essence of compilation. Proc. IFIP Working Conference on Formal Description of Programming Concepts, Vol. 1, 1977.
 
9
 
10
Hearn, A.C. REDUCE-2 Users Manual, Computing Physics Group, University of Utah. 1973.
 
11
Hearn, A.C. A mode analysing Algebraic Manipulation Program. Proc. ACM 74, San Diego, California 1974.
12
 
13
IBM - LISP/370 Program Description /Operations Manual, Document SH20-2076-0, IBM Corp., Dept. 825, 1133 Westchester Ave., White Plains, N.Y. March 1978.
 
14
Jenks, R.D. On the Design of a Mode-Based Symbolic System, Proc. 10th. International Conference of System Studies, Hawaii 1977.
 
15
 
16
17
18
19
20


Collaborative Colleagues:
James H. Davenport: colleagues
Richard D. Jenks: colleagues