William Clinger
- 1.Alan Bawden and Jonathan Rees. Syntactic closures. 1988 A CM Conference on Lisp and Functional Programming, pages 86-95. Google Scholar
Digital Library
- 2.P. J. Brown. Macro Processors and Techniques :for Portable So}twa re. Wiley, 1974. Google ScholarDigital Library
- 3.William Clinger and Jonathan Rees, editors. Revised4 report on the algorithmic language Scheme. University of Oregon Technical Report CIS-TR-90-02, to appear.Google Scholar
- 4.Pavel Curtis and James Rauen. A module system for Scheme. 1990 A CM Conference on Lisp and Functional Programming, pages 13-19. Google ScholarDigital Library
- 5.R. Kent Dybvig. The Scheme Programming Language. Prentice-Hall, 1987. Google ScholarDigital Library
- 6.Chris Hanson. Personal communication.Google Scholar
- 7.Samuel P. Harbison and Guy L. Steele Jr. C: A Reference Manual. Prentice-Hall, second edition 1987. Google ScholarDigital Library
- 8.Eugene Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba. Hygienic macro expansion. 1986 A CM Conference on Lisp and Functional Pro. gramming, pages 151-159. Google ScholarDigital Library
- 9.Eugene E. Kohlbecker Jr. Syntactic extensions in the programming language Lisp. Technical report no. 199, Indiana University Computer Science Department, 1986.Google Scholar
- 10.Jonathan A. Rees and William Clinger, editors. Revised3 report on the algorithmic language Scheme. SIGPLAN Notices 21(12), pages 37-79, 1986. Google ScholarDigital Library
- 11.Guy L. Steele Jr. Common Lisp: The Language. Digital Press, second edition 1990. Google ScholarDigital Library
Index Terms
- Macros that work
Recommendations
Routability-driven Mixed-size Placement Prototyping Approach Considering Design Hierarchy and Indirect Connectivity Between Macros
DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019The mixed-size placement becomes a great challenge in the modern VLSI design. To handle this problem, the three-stage mixed-size placement methodology is considered as the most suitable approach for a commercial design flow, where the placement ...
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
MP-trees: a packing-based macro placement algorithm for mixed-size designs
DAC '07: Proceedings of the 44th annual Design Automation ConferenceIn this paper, we present a new multi-packing tree (MP-tree) representation for macro placement to handle mixed-size designs. Based on binary trees, the MP-tree is very efficient, effective, and flexible for handling macro placement with various ...
Comments