- OPERA: Controlling Operational As noted in the exposition of Chapter 5, the sliver technique depends crucially on three
- Faithful Translations between Polyvariant Flows and Polymorphic Types
- EDGAR: Explicit Demand Graph I have demonstrated how slivers and synchronized lazy aggregates can be realized using
- Functioning without Closure: TypeSafe Customized Function Representations for Standard ML
- Program Representation Size in an Intermediate Language
- A Computationally Sound CallByValue Module Calculus Elena Machkasova #
- Program Representation Size in an Intermediate Language
- Program Representation Size in an Intermediate Language
- Lumberjack Summer Camp: A Cross-Institutional Undergraduate Research Experience in Computer Science
- Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems
- Robotic Design Studio: Exploring the Big Ideas of Engineering
- Strongly Typed FlowDirected Representation Transformations (Extended Abstract)
- Faithful Translations between Polyvariant Flows and Polymorphic Types
- 10.1 Summary The solutions to many programming problems can naturally be expressed as the composi
- This chapter introduces a class of programming idioms that I call slivers. Slivers capture the generating, mapping, filtering, and accumulating idioms commonly found in loops and
- Computational Shape The goal of slivers is to decompose monolithic recursive procedures into networks of mix
- Faithful Translations between Polyvariant Flows and Polymorphic Types
- This chapter describes the experimental aspects of my research. I discuss the systems I have implemented to experiment with my ideas, describe the tests I have undertaken with
- Synchronized Lazy Aggregates Franklyn Turbak
- To Appear in J. Functional Programming 1 A Calculus with Polymorphic
- Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
- Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
- Faithful Translations between Polyvariant Flows and Polymorphic Types
- Program Representation Size in an Intermediate Language
- Strongly Typed Flow-Directed Representation Transformations (Extended Abstract)
- A Typed Intermediate Language for Flow-Directed Compilation
- First-Class Synchronization Barriers Franklyn Turbak
- A Computationally Sound Call-By-Value Module Calculus Elena Machkasova
- Bibliography [AA93] Zena Ariola and Arvind. Graph rewriting systems: Capturing sharing of com
- Compiling with Polymorphic and Polyvariant Flow Types # Franklyn Turbak
- This dissertation defines many new terms and uses some existing terms in a nonstandard way. As an aid to the reader, this glossary contains definitions of these terms. Each entry
- SYNAPSE: Programming with Slivers and Slags
- Robotic Design Studio: Exploring the Big Ideas of Engineering In a Liberal Arts Environment
- Compiling with Polymorphic and Polyvariant Flow Types Franklyn Turbak
- Acknowledgments Many people skip over the acknowledgments when they read a book. Not me. Every book
- Computational Modularity via Synchronized Lazy Aggregates
- Synchronized Lazy Aggregates In Chapter 3, we saw how existing techniques for programming in the signal processing
- Relating Typability and Expressiveness in FiniteRank Intersection Type Systems
- To Appear in J. Functional Programming 1 A Calculus with Polymorphic
- 1 Overview 19 1.1 The Problem : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 20
- Lumberjack Summer Camp: A CrossInstitutional Undergraduate Research Experience in Computer Science #
- The Signal Processing Style of Programming
- FirstClass Synchronization Barriers Franklyn Turbak
- A Typed Intermediate Language for FlowDirected Compilation #
- Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
- Appears in the Journal of Computing in Small Colleges, Volume 14, Numer 4, May 1999, pp 86-101
- An Aspect-Oriented Approach to the Undergraduate Programming Language Curriculum
