Jon Fairbairn

According to our database, Jon Fairbairn authored at least 9 papers between 1984 and 1992.

Collaborative distances:

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

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

1989

Non-Strict Languages - Programming and Implementation.

Stuart Wray, Jon Fairbairn

Comput. J., 1989

1987

Making Form Follow Function: An Exercise in Functional Programming Style.

Jon Fairbairn

Softw. Pract. Exp., 1987

TIM: A simple, lazy abstract machine to execute supercombinatorics.

Jon Fairbairn, Stuart Wray

Proceedings of the Functional Programming Languages and Computer Architecture, 1987

Implementing Functional Databases.

Guy Argo, John Hughes, Philip W. Trinder, Jon Fairbairn, John Launchbury

Proceedings of the Advances in Database Programming Languages, 1987

1986

A New Type-Checker for a Functional Language.

Jon Fairbairn

Sci. Comput. Program., 1986

Code Generation Techniques for Functional Languages.

Jon Fairbairn, Stuart Wray

Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

A simple abstract machine to execute supercombinators.

Jon Fairbairn

Proceedings of the Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29, 1986

1984

Design and implementation of a simple typed language based on the lambda-calculus.

Jon Fairbairn

PhD thesis, 1984