论文信息 - The Categorical Multi-Combinator Machine: CMCM

The Categorical Multi-Combinator Machine: CMCM

Implementations of functional programming languages can take a number of different forms, and many different machines have been developed for this purpose. This paper introduces another abstract machine, the Categorical Multi-Combinator Machine (CMCM). A thorough introduction to the machines is given, particularly as far as the discussion of the starting of computational information is concerned.

Rafael Dueire Lins | Simon J. Thompson | S. Thompson | R. Lins

[1] Joyce L. Vedral,et al. Functional Programming Languages and Computer Architecture , 1989, Lecture Notes in Computer Science.

[2] David Turner. An overview of Miranda , 1986, SIGP.

[3] John H. Williams,et al. Design and Implementation of Programming Languages , 1977 .

[4] Rafael Dueire Lins. Categorical multi-combinators , 1987, FPCA.

[5] S. Kamal Abdali,et al. An abstraction algorithm for combinatory logic , 1976, Journal of Symbolic Logic.

[6] Thomas Johnsson,et al. Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[7] P. J. Landin. The Mechanical Evaluation of Expressions , 1964, Comput. J..

[8] David Turner,et al. Research topics in functional programming , 1990 .

[9] David Turner. An overview of Miranda 1 , 1990 .

[10] Benjamin Goldberg,et al. Detecting sharing of partial applications in functional programs , 1987, FPCA.

[11] Pierre-Louis Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[12] Peter Henderson,et al. Functional programming - application and implementation , 1980, Prentice Hall International Series in Computer Science.

[13] Thomas Johnsson,et al. Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.

[14] Chris Hankin,et al. Abstract Interpretation of Declarative Languages , 1987 .