|
 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
|
BARENDREGT, H.P, BERGSTRA, J, KLOP, J W, AND VOLKEN, H Degrees, reductions and representablhty m the A-calculus Math Dept Rep., U of Utrecht, Utrecht, Netherlands, Jan 1976
|
| |
2
|
BERRY, G. Bottom-up computations of recurstve programs R A LR 0 Informattque Thbor~que I0, 3 (March 1976), 47-82
|
| |
3
|
BERRY, G Les calculs mtmmaux et optlmaux des programmes et leurs mterpr6tattons stables To appear
|
| |
4
|
BIRKHOFF, G Latuce theory. In Coil. Pubhcauons, Vol 25, Amer Math Soc, Providence, R I, 3rd ed, 1967.
|
| |
5
|
|
| |
6
|
|
| |
7
|
COURCELLE, B, AND N}VAT, M Algebraic famlhes ofmterpretanons Proc 17th Annual Symp Foundations Comptr. Sol, Houston, Tex., 1976
|
| |
8
|
CURRY, H.B., maD FEYS, R Combmatory Logic, VoL 1 North-Holland Pub., Co., Amsterdam, 1958.
|
| |
9
|
DOWNEY, P.J., ~D SETHI, R Correct computaUon rules for recurslve languages SlAM J Comptng 5, 3 (Sept 1976), 378-401.
|
 |
10
|
|
| |
11
|
HINDLEY, R Reductions of residuals are fimte Math Dept, U of Swansea, Swansea, England, 1976
|
| |
12
|
KAHN, G, AND McQUEEN, D Coroutmes and networks of parallel processes. Information Processing 77, North-Holland Pub Co., Amsterdam, 1977, pp. 993-998
|
| |
13
|
KAHN, G., AND PLOTKIN, G. Concrete data types To appear
|
| |
14
|
LgvY, J J. An algebraic mterpretatlon of the ApK-calculus and a labelled A-calculus Theoret Comptr Sct. 2, 1 (1976), 97-114
|
| |
15
|
LI~vY, J J R6ducttons correctes et optimales dans le A-calcul Th de Doctorat d'Etat, Umversit6 Paris VII, Parts, 1978
|
| |
16
|
MILNER, R Fully abstract models of typed A-calcuh To appear m Theoret Comptr Scl.
|
| |
17
|
MITSCHKE, G. The standard~satzon theorem for the A-calculus Math. Dept, U of Swansea, Swansea, England, 1975
|
| |
18
|
|
| |
19
|
MORRIS, J.H. Lambda calculus models of programming languages. Ph.D Th., M I T, Cambndge, Mass., 1968
|
| |
20
|
NIVAT, M. On the interpretations of recurstve programs schemes In Symposia Matemat~ca, Vol XV Inst Nazionale dl Alta Matematica, Rome, Italy, 1975, pp. 225-281
|
| |
21
|
|
| |
22
|
|
| |
23
|
SCOTT, D. Outhne of a mathematical theory of computation Programming Research Group, Mono No. 2, Oxford, 1970
|
| |
24
|
TRAKHTENBROT, M.B On representauon of sequential and parallel funcuons Computauonal Mathemaucs and Programming (collected papers), Novostblrsk, USSR, 1974
|
| |
25
|
|
| |
26
|
VUILLEMIN, J Syntaxe, semanttque et axtomattque d'un langage de programmatton simple. Th. de Umverstt6 de Pans VII, t974
|
| |
27
|
WADSWORTH, C P Semantics and pragmatics of the ~,-calculus Ph D Th, Oxford U, Oxford, England, 1971
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.3