Will Partain

According to our database, Will Partain authored at least 8 papers between 1990 and 2002.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2002

ARK: An Object(ive) view of eXtensible Minimal Languages for System Configuration.

Matt Holgate, Will Partain

Inf. Softw. Technol., 2002

2001

The Arusha Project: A Framework for Collaborative UNIX System Administration.

Matt Holgate, Will Partain

Proceedings of the 15th Conference on Systems Administration (LISA 2001), 2001

1996

Let-floating: Moving Bindings to Give Faster Programs.

Simon L. Peyton Jones, Will Partain, André L. M. Santos

Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

1993

Measuring the effectiveness of a simple strictness analyser.

Simon Peyton Jones, Will Partain

Proceedings of the 1993 Glasgow Workshop on Functional Programming, 1993

1992

Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.

Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph H. Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard B. Kieburtz, Rishiyur S. Nikhil, Will Partain, John Peterson

ACM SIGPLAN Notices, 1992

The nofib Benchmark Suite of Haskell Programs.

Will Partain

Proceedings of the Functional Programming, 1992

The Glasgow Haskell Compiler: A Retrospective.

Cordelia V. Hall, Kevin Hammond, Will Partain, Simon L. Peyton Jones, Philip Wadler

Proceedings of the Functional Programming, 1992

1990

Normal-Order Reduction Using Scan Primitives.

William D. Partain

Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990