A correspondence between ALGOL 60 and Church's Lambda-notations: Part II
Communications of the ACM
The next 700 programming languages
Communications of the ACM
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Procedures as persistent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A survey of the literature in computer science education since curriculum '68
Communications of the ACM
A bonus from van Wijngaarden's device
Communications of the ACM
Protection in programming languages
Communications of the ACM
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
Communications of the ACM
A Metalanguage for interactive proof in LCF
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
The lambda calculus and its relation to programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Some examples of the use of function-producing functions
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Proceedings of ACM conference on Proving assertions about programs
QUEST: the design of a very high level, pedagogic programming language
ACM SIGPLAN Notices
ACM SIGPLAN Notices
The equivalence of sequential and associate information structure models
ACM SIGPLAN Notices
A history of Haskell: being lazy with class
Proceedings of the third ACM SIGPLAN conference on History of programming languages
SAL: systems assembly languages
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Mathematical concepts in programming language semantics
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
IBM Journal of Research and Development
Hi-index | 0.08 |
This paper describes PAL—a new computer language. Given the fact that new languages seem to appear in computer literature at the rate of several per month, it seems incumbent on one who creates a new language to justify having done so. In the present case, there are two important considerations: control and specification. Let us consider each of these in turn. By virtue of our having designed PAL, it is ours. There is no PAL Users Group or Committee of Vested Interests concerned with retaining upward compatibility with what was done last year (or last month). This doesn't mean we change the specifications of the language every few weeks (our students are, in a real sense, our Committee of Vested Interests), but it does mean we can make decisions on changes solely on technical grounds. More important, though, we can design the language to meet the criteria we think important. For example, the language almost demands interpretive execution. Since no one writes production programs in PAL we are able to put up with inefficiencies in the implementation that would otherwise be intolerable. Thus we have designed our own language so that we will have control over it.