论文信息 - Linear Explicit Substitutions ( Extended Abstract )

Linear Explicit Substitutions ( Extended Abstract )

The -calculus [1] adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the -calculus to provide a linear calculus of explicit substitutions which analogously describes the implementation of linear functional programming languages.

Valeria de Paiva | Neil Ghani | Eike Ritter

[1] Paul-Andr. Typed -calculi with Explicit Substitutions May Not Terminate , 1995 .

[2] Valeria de Paiva,et al. On Explicit Substitution and Names (Extended Abstract) , 1997, ICALP.

[3] Yves Lafont,et al. The Linear Abstract Machine , 1988, Theor. Comput. Sci..

[4] Andrew G. Barber,et al. Linear type theories, semantics and action calculi , 1997 .

[5] Neil Ghani. Adjoint Rewriting and the !-type constructor , 1996 .

[6] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[7] Ian Mackie,et al. Lilac: a functional programming language based on linear logic , 1994, Journal of Functional Programming.

[8] Ian Mackie,et al. The geometry of interaction machine , 1995, POPL '95.

[9] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.

[10] Carl A. Gunter,et al. Reference counting as a computational interpretation of linear logic , 1996, Journal of Functional Programming.

[11] Valeria de Paiva,et al. Linear Explicit Substitutions , 2000, Log. J. IGPL.

[12] Vincent Danos,et al. On the linear decoration of intuitionistic derivations , 1995, Arch. Math. Log..

[13] Neil Ghani,et al. Explicit Substitutions for Constructive Necessity , 1998, ICALP.