Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
The next 700 programming languages
Communications of the ACM
Proceedings of the International Colloquium on Formalization of Programming Concepts
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Data type specification: Parameterization and the power of specification techniques
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
A methodology for synthesis of recursive functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient execution of programs with static semantics
ACM SIGPLAN Notices
ICSE '85 Proceedings of the 8th international conference on Software engineering
Rewriting systems on FP expressions that reduce the number of sequences they yield
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Busy and lazy FP with infinite objects
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Combinatory foundation of functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Toward an algebra of nondeterministic programs
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Operational specification languages
ACM '83 Proceedings of the 1983 annual conference on Computers : Extending the human resource
Hi-index | 0.00 |
Most programs written today are “object-level” programs. That is, programs describe how to combine various “objects” (i.e., numbers, symbols, arrays, etc.) to form other objects until the final “result objects” have been formed. New objects are constructed from existing ones by the application of various object-to-object functions such as + or matrix inversion. Conventional, von Neumann programs are object level; “expressions” on the right side of assignment statements are exclusively concerned with building an object that is then to be stored. Lambda calculus based languages, such as LISP and ISWIM [Landin 66], are also, in practice, object level languages, although they have the means to be more.