The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John Hughes: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John Hughes
    Lazy Memo-functions. [Citation Graph (3, 0)][DBLP]
    FPCA, 1985, pp:129-146 [Conf]
  2. Guy Argo, John Hughes, Philip W. Trinder, Jon Fairbairn, John Launchbury
    Implementing Functional Databases. [Citation Graph (2, 5)][DBLP]
    DBPL, 1987, pp:165-176 [Conf]
  3. John Hughes
    A Distributed Garbage Collection Algorithm. [Citation Graph (2, 0)][DBLP]
    FPCA, 1985, pp:256-271 [Conf]
  4. John Hughes
    Why Functional Programming Matters. [Citation Graph (2, 0)][DBLP]
    Comput. J., 1989, v:32, n:2, pp:98-107 [Journal]
  5. 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
    Report on the Programming Language Haskell, A Non-strict, Purely Functional Language. [Citation Graph (1, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:5, pp:0-0 [Journal]
  6. Nick Benton, John Hughes, Eugenio Moggi
    Monads and Effects. [Citation Graph (0, 0)][DBLP]
    APPSEM, 2000, pp:42-122 [Conf]
  7. Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, Malcolm Wallace
    Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 2002, pp:59-99 [Conf]
  8. John Hughes
    Programming with Arrows. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 2004, pp:73-129 [Conf]
  9. John Hughes
    The Design of a Pretty-printing Library. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1995, pp:53-96 [Conf]
  10. John Hughes
    The Realities of PKI Inter-operability. [Citation Graph (0, 0)][DBLP]
    CQRE, 1999, pp:127-132 [Conf]
  11. John Hughes
    Projections for Polymorphic Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1989, pp:82-100 [Conf]
  12. John Hughes
    Type Specialisation for the lambda-Calculus; or, A New Paradigm for Partial Evaluation Based on Type Inference. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Partial Evaluation, 1996, pp:183-215 [Conf]
  13. John Hughes, Eric Atwell
    The Automated Evaluation of Inferred Word Classifications. [Citation Graph (0, 0)][DBLP]
    ECAI, 1994, pp:535-539 [Conf]
  14. Rogardt Heldal, John Hughes
    Binding-Time Analysis for Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:191-204 [Conf]
  15. John Hughes
    The Correctness of Type Specialisation. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:215-229 [Conf]
  16. John Hughes, John Launchbury
    Reversing Abstract Interpretations. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:269-286 [Conf]
  17. John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler
    Avoiding Unnecessary Updates. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:144-153 [Conf]
  18. Gebreselassie Baraki, John Hughes
    Abstract Interpretation of Polymorphic Functions. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:31-40 [Conf]
  19. Alex Ferguson, John Hughes
    An Iterative Powerdomain Construction. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:41-55 [Conf]
  20. Alex Ferguson, John Hughes
    Abstract Interpretation of Higher Order Functions Using Concrete Data Structures (Summary). [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:57-61 [Conf]
  21. Carsten Kehler Holst, John Hughes
    A Loop-Detecting Interpreter for Lazy Programs. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:164-176 [Conf]
  22. John Hughes, Alex Ferguson
    A Loop-Detecting Interpreter for Lazy, Higher-Order Programs. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:85-101 [Conf]
  23. John Hughes, Andrew Moran
    A Semantics for Locally Bottom-Avoiding Choice. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:102-112 [Conf]
  24. John Hughes, John O'Donnell
    Expressing and Reasoning About Non-Deterministic Functional Programs. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:308-328 [Conf]
  25. Ryszard Kubiak, John Hughes, John Launchbury
    Implementing Projection-based Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:207-224 [Conf]
  26. John Hughes, Andrew Moran
    Making Choices Lazily. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:108-119 [Conf]
  27. Dirk Dussart, John Hughes, Peter Thiemann
    Type Specialization for Imperative Languages. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:204-216 [Conf]
  28. Koen Claessen, John Hughes
    QuickCheck: a lightweight tool for random testing of Haskell programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 2000, pp:268-279 [Conf]
  29. John Hughes, Lars Pareto
    Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming. [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:70-81 [Conf]
  30. John Hughes, Andrew D. McGettrick, Ellen Francine Barbosa, Jens Kaasbøll, Vinícius Medina Kern, Ana Paula Lüdtke Ferreira, Esselina Macome, Joberto Martins, Clara Amélia de Oliveira, Alfonso Ignacio Orth, R. Sadananda, Elaine da Silva, Romero Tori
    Directions and Challenges in Informatics Education. [Citation Graph (0, 0)][DBLP]
    Informatics Curricula and Teaching Methods, 2002, pp:115-123 [Conf]
  31. John Hughes
    Pretty-printing: An Exercise in Functional Programming. [Citation Graph (0, 0)][DBLP]
    MPC, 1992, pp:11-13 [Conf]
  32. John Hughes
    Generalising Monads (Abstract). [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:6- [Conf]
  33. M. K. Serour, Brian Henderson-Sellers, John Hughes, D. Winder, L. Chow
    Organizational Transition to Object Technology: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    OOIS, 2002, pp:229-241 [Conf]
  34. John Hughes
    QuickCheck Testing for Fun and Profit. [Citation Graph (0, 0)][DBLP]
    PADL, 2007, pp:1-32 [Conf]
  35. Walid Taha, Henning Makholm, John Hughes
    Tag Elimination and Jones-Optimality. [Citation Graph (0, 0)][DBLP]
    PADO, 2001, pp:257-275 [Conf]
  36. John Hughes
    Strictness detection in non-flat domains. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:112-135 [Conf]
  37. Rogardt Heldal, John Hughes
    Partial Evaluation and Separate Compilation. [Citation Graph (0, 0)][DBLP]
    PEPM, 1997, pp:1-11 [Conf]
  38. John Hughes
    A Type Specialisation Tutorial. [Citation Graph (0, 0)][DBLP]
    Partial Evaluation, 1998, pp:293-325 [Conf]
  39. Pablo E. Martínez López, John Hughes
    Principal type specialisation. [Citation Graph (0, 0)][DBLP]
    ASIA-PEPM, 2002, pp:94-105 [Conf]
  40. Dirk Dussart, Rogardt Heldal, John Hughes
    Module-Sensitive Program Specialisation. [Citation Graph (0, 0)][DBLP]
    PLDI, 1997, pp:206-214 [Conf]
  41. Nils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons
    Fast and loose reasoning is morally correct. [Citation Graph (0, 0)][DBLP]
    POPL, 2006, pp:206-217 [Conf]
  42. John Hughes, Lars Pareto, Amr Sabry
    Proving the Correctness of Reactive Systems Using Sized Types. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:410-423 [Conf]
  43. Alex Ferguson, John Hughes
    Fast Abstract Interpretation Using Sequential Algorithms. [Citation Graph (0, 0)][DBLP]
    WSA, 1993, pp:45-59 [Conf]
  44. Don McFall, Gillian Sleith, John Hughes
    Reverse Engineering Structured Code to an Object-Oriented Representation. [Citation Graph (0, 0)][DBLP]
    SEKE, 1993, pp:86-93 [Conf]
  45. John Hughes
    Certificate inter-operability - white paper. [Citation Graph (0, 0)][DBLP]
    Computers & Security, 1999, v:18, n:3, pp:221-230 [Journal]
  46. John Hughes
    Type Specialization. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:3es, pp:14- [Journal]
  47. Richard S. Bird, John Hughes
    The alpha-beta Algorithm: An Exercise in Program Transformation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:53-57 [Journal]
  48. John Hughes
    A Novel Representation of Lists and its Application to the Function "reverse". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:3, pp:141-144 [Journal]
  49. John Hughes
    Global variables in Haskell. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:5, pp:489-502 [Journal]
  50. John Hughes, John Launchbury
    Relational Reversal of Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:4, pp:465-482 [Journal]
  51. John Hughes, John Launchbury
    Projections for Polymorphic First-Order Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1992, v:2, n:3, pp:301-326 [Journal]
  52. John Hughes
    Generalising monads to arrows. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2000, v:37, n:1-3, pp:67-111 [Journal]
  53. John Hughes, John Launchbury
    Reversing Abstract Interpretations. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:22, n:3, pp:307-326 [Journal]
  54. Koen Claessen, John Hughes
    Testing monadic code with QuickCheck. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2002, v:37, n:12, pp:47-59 [Journal]
  55. Simon L. Peyton Jones, John Hughes, John Launchbury
    How to Give a Good Research Talk. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1993, v:28, n:11, pp:9-12 [Journal]
  56. Rogardt Heldal, John Hughes
    Extending a partial evaluator which supports separate compilation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:248, n:1-2, pp:99-145 [Journal]
  57. Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler
    A history of Haskell: being lazy with class. [Citation Graph (0, 0)][DBLP]
    HOPL, 2007, pp:1-55 [Conf]
  58. Andreas Abel, Marcin Benke, Ana Bove, John Hughes, Ulf Norell
    Verifying haskell programs using constructive type theory. [Citation Graph (0, 0)][DBLP]
    Haskell, 2005, pp:62-73 [Conf]

  59. Closing Internal Timing Channels by Transformation. [Citation Graph (, )][DBLP]


  60. A Library for Secure Multi-threaded Information Flow in Haskell. [Citation Graph (, )][DBLP]


  61. Testing telecoms software with quviq QuickCheck. [Citation Graph (, )][DBLP]


  62. Testing Erlang data types with quviq quickcheck. [Citation Graph (, )][DBLP]


  63. Finding race conditions in Erlang with QuickCheck and PULSE. [Citation Graph (, )][DBLP]


  64. QuickSpec: Guessing Formal Specifications Using Testing. [Citation Graph (, )][DBLP]


  65. A library for light-weight information-flow security in haskell. [Citation Graph (, )][DBLP]


  66. Automatic Extraction of Tagset Mappings from Parallel-Annotated Corpora [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002