Recursive functions of symbolic expressions and their computation by machine, Part I
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)
A methodology for synthesis of recursive functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining object-oriented and functional paradigms in a design methodology for Ada
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deriving Target Code as a Representation of Continuation Semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data sharing in an FFP machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A simple optimizer for FP-like languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Optimal associative searching on a cellular computer
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Aspects of applicative programming for file systems (Preliminary Version)
Proceedings of an ACM conference on Language design for reliable software
ACM Turing award lectures
Aspects of Applicative Programming for Parallel Processing
IEEE Transactions on Computers
Hi-index | 0.02 |
This paper proposes axioms to define a sequence of language-classes; the most general is that of "programming language", the most restricted has some simple and attractive properties. Here "language" is used in its traditional sense as referring to a set of interpreted expressions. We are concerned with the syntax of an expression only to the degree needed to relate its structure to its "meaning". A clear distinction is drawn between a "language" and the many possible "realizations" of that language.This introduction comprises a survey and opinionated discussion of the contents of the paper, therefore the reader who wishes to get on with the technical exposition can skip to the next section.