2008 |
40 | EE | John Launchbury:
Industrial Functional Programming.
PADL 2008: 1 |
2004 |
39 | EE | John Launchbury:
Galois: high assurance software.
ICFP 2004: 3 |
2003 |
38 | EE | Premkumar T. Devanbu,
Robert Balzer,
Don S. Batory,
Gregor Kiczales,
John Launchbury,
David Lorge Parnas,
Peri L. Tarr:
Modularity in the New Millenium: A Panel Summary.
ICSE 2003: 723-725 |
2002 |
37 | EE | Levent Erkök,
John Launchbury,
Andrew Moran:
Semantics of value recursion for Monadic Input/Output.
ITA 36(2): 155-180 (2002) |
2001 |
36 | EE | Sava Krstic,
John Launchbury,
Dusko Pavlovic:
Categories of Processes Enriched in Final Coalgebras.
FoSSaCS 2001: 303-317 |
2000 |
35 | EE | Levent Erkök,
John Launchbury:
Recursive monadic bindings.
ICFP 2000: 174-185 |
34 | EE | Jeffrey R. Lewis,
John Launchbury,
Erik Meijer,
Mark Shields:
Implicit Parameters: Dynamic Scoping with Static Types.
POPL 2000: 108-118 |
1999 |
33 | EE | John Matthews,
John Launchbury:
Elementary Microarchitecture Algebra.
CAV 1999: 288-300 |
32 | EE | Byron Cook,
John Launchbury,
John Matthews,
Richard B. Kieburtz:
Formal Verification of Explicitly Parallel Microprocessors.
CHARME 1999: 23-36 |
31 | EE | John Launchbury,
Jeffrey R. Lewis,
Byron Cook:
On Embedding a Microarchitectural Design Language within Haskell.
ICFP 1999: 60-69 |
1998 |
30 | EE | John Matthews,
Byron Cook,
John Launchbury:
Microprocessor Specification in Hawk.
ICCL 1998: 90-101 |
29 | EE | Simon L. Peyton Jones,
Mark Shields,
John Launchbury,
Andrew P. Tolmach:
Bridging the Gulf: A Common Intermediate Language for ML and Haskell.
POPL 1998: 49-61 |
1997 |
28 | | John Launchbury,
Amr Sabry:
Monadic State: Axiomatization and Type Safety.
ICFP 1997: 227-238 |
27 | | Byron Cook,
John Launchbury:
Disposable Memo Functions (Extended Abstract).
ICFP 1997: 310 |
1996 |
26 | | John Launchbury,
Erik Meijer,
Tim Sheard:
Advanced Functional Programming, Second International School, Olympia, WA, USA, August 26-30, 1996, Tutorial Text
Springer 1996 |
25 | | John Launchbury,
Ross Paterson:
Parametricity and Unboxing with Unpointed Types.
ESOP 1996: 204-218 |
24 | | John Launchbury,
Gebreselassie Baraki:
Representing Demand by Partial Projections.
J. Funct. Program. 6(4): 563-585 (1996) |
1995 |
23 | | John Launchbury:
Graph Algorithms with a Functional Flavous.
Advanced Functional Programming 1995: 308-331 |
22 | | John Launchbury,
Tim Sheard:
Warm Fusion: Deriving Build-Cata's from Recursive Definitions.
FPCA 1995: 314-323 |
21 | | David J. King,
John Launchbury:
Structuring Depth-First Search Algorithms in Haskell.
POPL 1995: 344-354 |
20 | | John Launchbury,
Simon L. Peyton Jones:
State in Haskell.
Lisp and Symbolic Computation 8(4): 293-341 (1995) |
1994 |
19 | | John Launchbury,
Simon L. Peyton Jones:
Lazy Funtional State Threads: An Abstract.
ICLP 1994: 3-5 |
18 | | John Launchbury,
Simon L. Peyton Jones:
Lazy Functional State Threads.
PLDI 1994: 24-35 |
17 | | John Hughes,
John Launchbury:
Reversing Abstract Interpretations.
Sci. Comput. Program. 22(3): 307-326 (1994) |
1993 |
16 | | John Launchbury,
Patrick M. Sansom:
Functional Programming, Glasgow 1992, Proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, 6-8 July 1992
Springer 1993 |
15 | | Andrew J. Gill,
John Launchbury,
Simon L. Peyton Jones:
A Short Cut to Deforestation.
FPCA 1993: 223-232 |
14 | | John Launchbury:
A Natural Semantics for Lazy Evaluation.
POPL 1993: 144-154 |
13 | | Simon L. Peyton Jones,
John Hughes,
John Launchbury:
How to Give a Good Research Talk.
SIGPLAN Notices 28(11): 9-12 (1993) |
1992 |
12 | | John Hughes,
John Launchbury:
Reversing Abstract Interpretations.
ESOP 1992: 269-286 |
11 | | John Launchbury,
Andy Gill,
John Hughes,
Simon Marlow,
Simon L. Peyton Jones,
Philip Wadler:
Avoiding Unnecessary Updates.
Functional Programming 1992: 144-153 |
10 | | John Hughes,
John Launchbury:
Relational Reversal of Abstract Interpretation.
J. Log. Comput. 2(4): 465-482 (1992) |
9 | | John Hughes,
John Launchbury:
Projections for Polymorphic First-Order Strictness Analysis.
Mathematical Structures in Computer Science 2(3): 301-326 (1992) |
1991 |
8 | | John Launchbury:
A Strongly-Typed Self-Applicable Partial Evaluator.
FPCA 1991: 145-164 |
7 | | Simon L. Peyton Jones,
John Launchbury:
Unboxed Values as First Class Citizens in a Non-Strict Functional Language.
FPCA 1991: 636-666 |
6 | | Ryszard Kubiak,
John Hughes,
John Launchbury:
Implementing Projection-based Strictness Analysis.
Functional Programming 1991: 207-224 |
5 | | John Launchbury:
Strictness and Binding-Time Analyses: Two for the Price of One.
PLDI 1991: 80-91 |
1990 |
4 | | John Launchbury:
Strictness Analysis Aids Inductive Proofs.
Inf. Process. Lett. 35(3): 155-159 (1990) |
1989 |
3 | | John Launchbury:
Dependent Sums Express Separation of Binding Times.
Functional Programming 1989: 238-253 |
2 | | R. Frost,
John Launchbury:
Constructing Natural Language Interpreters in a Lazy Functional Language.
Comput. J. 32(2): 108-121 (1989) |
1987 |
1 | EE | Guy Argo,
John Hughes,
Philip W. Trinder,
Jon Fairbairn,
John Launchbury:
Implementing Functional Databases.
DBPL 1987: 165-176 |