论文信息 - CLEAN: a programming environment based on term graph rewriting - 字舞流文

CLEAN: a programming environment based on term graph rewriting

Abstract The main features of the lazy functional language Concurrent Clean and of its semantics based on Term Graph Rewriting are presented.

Marinus J. Plasmeijer | M. J. Plasmeijer

[1] Marko C. J. D. van Eekelen,et al. Parallel Graph Rewriting on Loosely Coupled Machine Architectures , 1990, CTRS.

[2] R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[3] Marko C. J. D. van Eekelen,et al. Concurrent Clean , 1991, PARLE.

[4] Erik Barendsen,et al. Conventional and Uniqueness Typing in Graph Rewrite Systems , 1993, FSTTCS.

[5] Eric Nöcker,et al. Strictness analysis using abstract reduction , 1993, FPCA '93.

[6] Marko C. J. D. van Eekelen,et al. CLEAN: A language for functional graph writing , 1987, FPCA.

[7] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[8] Robin Milner,et al. Standard ML: Report ECS-LFCS-86-2 , 1986 .

[9] WadlerPhilip,et al. Report on the programming language Haskell , 1992 .

[10] Marko C. J. D. van Eekelen,et al. Functional Programming and Parallel Graph Rewriting , 1993 .

[11] Marko C. J. D. van Eekelen,et al. Term Graph Rewriting , 1987, PARLE.

[12] Rinus Plasmeijer,et al. The functional strategy and transitive term rewriting systems , 1993 .

[13] Paul Hudak,et al. A gentle introduction to Haskell , 1992, SIGP.

[14] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[15] Marinus J. Plasmeijer,et al. Generating Efficient Code for Lazy Functional Languages , 1991, FPCA.