default search action
John Launchbury
Person information
- affiliation: Galois Inc., USA
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c40]Trevor Elliott, Lee Pike, Simon Winwood, Patrick C. Hickey, James Bielman, Jamey Sharp, Eric L. Seidel, John Launchbury:
Guilt free ivory. Haskell 2015: 189-200 - 2014
- [c39]John Launchbury, Dave Archer, Thomas DuBuisson, Eric Mertens:
Application-Scale Secure Multiparty Computation. ESOP 2014: 8-26 - [c38]Patrick C. Hickey, Lee Pike, Trevor Elliott, James Bielman, John Launchbury:
Building embedded systems with embedded DSLs. ICFP 2014: 3-9 - [c37]Lee Pike, Patrick C. Hickey, James Bielman, Trevor Elliott, Thomas DuBuisson, John Launchbury:
Programming languages for high-assurance autonomous vehicles: extended abstract. PLPV 2014: 1-2 - 2013
- [c36]John Launchbury, Sava Krstic, T. E. Sauerwein:
Coroutining Folds with Hyperfunctions. Festschrift for Dave Schmidt 2013: 121-135 - 2012
- [c35]John Launchbury, Iavor S. Diatchki, Thomas DuBuisson, Andy Adams-Moran:
Efficient lookup-table protocol in secure multiparty computation. ICFP 2012: 189-200 - 2011
- [c34]John Launchbury:
Theorem-based circuit derivation in cryptol. GPCE 2011: 185-186 - [e4]Ricardo Rocha, John Launchbury:
Practical Aspects of Declarative Languages - 13th International Symposium, PADL 2011, Austin, TX, USA, January 24-25, 2011. Proceedings. Lecture Notes in Computer Science 6539, Springer 2011, ISBN 978-3-642-18377-5 [contents] - 2010
- [c33]John Launchbury, Trevor Elliott:
Concurrent orchestration in Haskell. Haskell 2010: 79-90
2000 – 2009
- 2008
- [c32]John Launchbury:
Industrial Functional Programming. PADL 2008: 1 - 2004
- [c31]John Launchbury:
Galois: high assurance software. ICFP 2004: 3 - 2003
- [c30]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
- [j9]Levent Erkök, John Launchbury, Andrew Moran:
Semantics of value recursion for Monadic Input/Output. RAIRO Theor. Informatics Appl. 36(2): 155-180 (2002) - [c29]Levent Erkök, John Launchbury:
A recursive do for Haskell. Haskell 2002: 29-37 - [e3]John Launchbury, John C. Mitchell:
Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, January 16-18, 2002. ACM 2002, ISBN 1-58113-450-9 [contents] - 2001
- [c28]Sava Krstic, John Launchbury, Dusko Pavlovic:
Categories of Processes Enriched in Final Coalgebras. FoSSaCS 2001: 303-317 - 2000
- [c27]Levent Erkök, John Launchbury:
Recursive monadic bindings. ICFP 2000: 174-185 - [c26]Jeffrey R. Lewis, John Launchbury, Erik Meijer, Mark Shields:
Implicit Parameters: Dynamic Scoping with Static Types. POPL 2000: 108-118
1990 – 1999
- 1999
- [c25]John Matthews, John Launchbury:
Elementary Microarchitecture Algebra. CAV 1999: 288-300 - [c24]Byron Cook, John Launchbury, John Matthews, Richard B. Kieburtz:
Formal Verification of Explicitly Parallel Microprocessors. CHARME 1999: 23-36 - [c23]John Launchbury, Jeffrey R. Lewis, Byron Cook:
On Embedding a Microarchitectural Design Language within Haskell. ICFP 1999: 60-69 - 1998
- [c22]John Matthews, Byron Cook, John Launchbury:
Microprocessor Specification in Hawk. ICCL 1998: 90-101 - [c21]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
- [c20]John Launchbury, Amr Sabry:
Monadic State: Axiomatization and Type Safety. ICFP 1997: 227-238 - [c19]Byron Cook, John Launchbury:
Disposable Memo Functions (Extended Abstract). ICFP 1997: 310 - 1996
- [j8]John Launchbury, Gebreselassie Baraki:
Representing Demand by Partial Projections. J. Funct. Program. 6(4): 563-585 (1996) - [c18]John Launchbury, Ross Paterson:
Parametricity and Unboxing with Unpointed Types. ESOP 1996: 204-218 - [e2]John Launchbury, Erik Meijer, Tim Sheard:
Advanced Functional Programming, Second International School, Olympia, WA, USA, August 26-30, 1996, Tutorial Text. Lecture Notes in Computer Science 1129, Springer 1996, ISBN 3-540-61628-4 [contents] - 1995
- [j7]John Launchbury, Simon L. Peyton Jones:
State in Haskell. LISP Symb. Comput. 8(4): 293-341 (1995) - [c17]John Launchbury:
Graph Algorithms with a Functional Flavous. Advanced Functional Programming 1995: 308-331 - [c16]John Launchbury, Tim Sheard:
Warm Fusion: Deriving Build-Cata's from Recursive Definitions. FPCA 1995: 314-323 - [c15]David J. King, John Launchbury:
Structuring Depth-First Search Algorithms in Haskell. POPL 1995: 344-354 - 1994
- [j6]John Hughes, John Launchbury:
Reversing Abstract Interpretations. Sci. Comput. Program. 22(3): 307-326 (1994) - [c14]John Launchbury, Simon L. Peyton Jones:
Lazy Funtional State Threads: An Abstract. ICLP 1994: 3-5 - [c13]John Launchbury, Simon L. Peyton Jones:
Lazy Functional State Threads. PLDI 1994: 24-35 - 1993
- [j5]Simon L. Peyton Jones, John Hughes, John Launchbury:
How to Give a Good Research Talk. ACM SIGPLAN Notices 28(11): 9-12 (1993) - [c12]David J. King, John Launchbury:
Functional Graph Algorithms with Depth-First Search (Preliminary Summary). Functional Programming 1993: 145-155 - [c11]Andrew John Gill, John Launchbury, Simon L. Peyton Jones:
A Short Cut to Deforestation. FPCA 1993: 223-232 - [c10]John Launchbury:
A Natural Semantics for Lazy Evaluation. POPL 1993: 144-154 - [e1]John Launchbury, Patrick M. Sansom:
Functional Programming, Glasgow 1992, Proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, UK, 6-8 July 1992. Workshops in Computing, Springer 1993, ISBN 3-540-19820-2 [contents] - 1992
- [j4]John Hughes, John Launchbury:
Relational Reversal of Abstract Interpretation. J. Log. Comput. 2(4): 465-482 (1992) - [j3]John Hughes, John Launchbury:
Projections for Polymorphic First-Order Strictness Analysis. Math. Struct. Comput. Sci. 2(3): 301-326 (1992) - [c9]John Hughes, John Launchbury:
Reversing Abstract Interpretations. ESOP 1992: 269-286 - [c8]John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler:
Avoiding Unnecessary Updates. Functional Programming 1992: 144-153 - 1991
- [c7]Ryszard Kubiak, John Hughes, John Launchbury:
Implementing Projection-based Strictness Analysis. Functional Programming 1991: 207-224 - [c6]John Launchbury:
A Strongly-Typed Self-Applicable Partial Evaluator. FPCA 1991: 145-164 - [c5]Simon L. Peyton Jones, John Launchbury:
Unboxed Values as First Class Citizens in a Non-Strict Functional Language. FPCA 1991: 636-666 - [c4]John Launchbury:
Strictness and Binding-Time Analyses: Two for the Price of One. PLDI 1991: 80-91 - 1990
- [j2]John Launchbury:
Strictness Analysis Aids Inductive Proofs. Inf. Process. Lett. 35(3): 155-159 (1990) - [c3]John Hughes, John Launchbury:
Towards Relating Forwards and Backwards Analyses. Functional Programming 1990: 101-113
1980 – 1989
- 1989
- [b1]John Launchbury:
Projection factorisations in partial evaluation. University of Glasgow, UK, 1989 - [j1]R. Frost, John Launchbury:
Constructing Natural Language Interpreters in a Lazy Functional Language. Comput. J. 32(2): 108-121 (1989) - [c2]John Launchbury:
Dependent Sums Express Separation of Binding Times. Functional Programming 1989: 238-253 - 1987
- [c1]Guy Argo, John Hughes, Philip W. Trinder, Jon Fairbairn, John Launchbury:
Implementing Functional Databases. DBPL 1987: 165-176
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint