论文信息 - The Linear Abstract Machine (Corrigenda)

The Linear Abstract Machine (Corrigenda)

Abstract Linear Logic [6] provides a refinement of functional programming and suggests a new implementation technique, with the following features: • a synthesis of strict and lazy evaluation, • a clean semantics of side effects, • no garbage collector.

Yves Lafont

[1] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .

[2] Jean-Yves Girard,et al. Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[3] G. M. Kelly,et al. On MacLane's conditions for coherence of natural associativities, commutativities, etc. , 1964 .

[4] Ascánder Suárez,et al. Implementing functional languages in the Categorical Abstract Machine , 1986, LFP '86.

[5] Pierre-Louis Curien. Categorial Combinatory Logic , 1985, ICALP.

[6] M. E. Szabo,et al. The collected papers of Gerhard Gentzen , 1969 .

[7] Jean-Yves Girard. Linear Logic and Parallelism , 1986, Mathematical Models for the Semantics of Parallelism.

[8] M. E. Szabo. Algebra of proofs , 1978 .

[9] Per Martin-Löf,et al. Intuitionistic type theory , 1984, Studies in proof theory.

[10] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .

[11] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..

[12] Pierre-Louis Curien,et al. The Categorical Abstract Machine , 1987, Sci. Comput. Program..

[13] S. Maclane,et al. Categories for the Working Mathematician , 1971 .