Loading...
Please wait, while we are loading the content...
Similar Documents
Pi-red+: an interactive compiling graph reduction system for an applied lambda-calculus (1993).
| Content Provider | CiteSeerX |
|---|---|
| Author | Gärtner, Dietmar Kluge, Werner E. |
| Abstract | This paper describes a compiling graph reduction system which realizes the reduction semantics of a fully-edged applied lambda-calculus. High-level functional programs are conceptually executed as sequences of program transformations governed by full beta-reductions. They may be carried out step by step, and intermediate programs may be displayed in high-level notation, rendering the system suitable for interactive program design, high-level debugging, and also for teaching basic programming language concepts and language interpretation. Run-time eciency for production runs is achieved by means of an abstract stack machine ASM which serves as an intermediate level of code generation. It employs multiple stacks for reasonably fast function calls, optimized tail-end recursions, and earliest possible releases of subgraphs that are no longer needed. The ASM involves an interpreter if and only if potential naming conflicts need to be resolved when reducing partial function applications. |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | Applied Lambda-calculus Interactive Compiling Graph Reduction System Run-time Eciency Production Run Intermediate Level Compiling Graph Reduction System High-level Notation High-level Functional Program Fast Function Call Reduction Semantics Tail-end Recursion Code Generation Basic Programming Language Concept Full Beta-reductions Multiple Stack High-level Debugging Language Interpretation Possible Release Partial Function Application Program Transformation Interactive Program Design Potential Naming Conflict Abstract Stack Machine Asm Intermediate Program |
| Content Type | Text |
| Resource Type | Article |
