The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Colin Runciman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Adam Bakewell, Detlef Plump, Colin Runciman
    Checking the Shape Safety of Pointer Manipulations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:48-61 [Conf]
  2. Colin Runciman
    Deriving Functional Programs from Equational Specifications. [Citation Graph (0, 0)][DBLP]
    ADT, 1986, pp:- [Conf]
  3. 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]
  4. Colin Runciman, Niklas Röjemo
    Heap Profiling for Space Efficiency. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1996, pp:159-183 [Conf]
  5. Adam Bakewell, Detlef Plump, Colin Runciman
    Specifying Pointer Structures by Graph Reduction. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 2003, pp:30-44 [Conf]
  6. Alan J. Dix, Michael D. Harrison, Colin Runciman, Harold W. Thimbleby
    Interaction Models and the Principled Design of Interactive Systems. [Citation Graph (0, 0)][DBLP]
    ESEC, 1987, pp:118-126 [Conf]
  7. Andrew Douglas, Niklas Röjemo, Colin Runciman, Alan Wood
    Astro-Gofer: Parallel Functional Programming with Co-ordinating Processes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:686-693 [Conf]
  8. Adam Bakewell, Colin Runciman
    Automated Generalisation of Function Definitions. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:225-240 [Conf]
  9. Colin Runciman, Mike Firth, Nigel Jagger
    Transformation in a Non-Strict Language: An Approach to Instantiation. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:133-141 [Conf]
  10. Colin Runciman
    TIP in Haskell - another Exercise in Functional Programming. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:278-292 [Conf]
  11. Colin Runciman, David Wakeling
    Heap Profiling of a Lazy Functional Compiler. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:203-214 [Conf]
  12. Paul Sanders, Colin Runciman
    LZW Text Compression in Haskell. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:215-226 [Conf]
  13. Dave Cattrall, Colin Runciman
    Widening the Representation Bottleneck: A Functional Implementation of Relational Programming. [Citation Graph (0, 0)][DBLP]
    FPCA, 1993, pp:191-200 [Conf]
  14. Colin Runciman, Ian Toyn
    Retrieving Re-Usable Software Components by Polymorphic Type. [Citation Graph (0, 0)][DBLP]
    FPCA, 1989, pp:166-173 [Conf]
  15. Ian Toyn, Alan J. Dix, Colin Runciman
    Performance polymorphism. [Citation Graph (0, 0)][DBLP]
    FPCA, 1987, pp:325-346 [Conf]
  16. David Wakeling, Colin Runciman
    Linearity and Laziness. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:215-240 [Conf]
  17. Malcolm Wallace, Colin Runciman
    Lambdas in the Liftshaft - Functional Programming and an Embedded Architecture. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:249-258 [Conf]
  18. Niklas Röjemo, Colin Runciman
    Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited. [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:34-41 [Conf]
  19. Malcolm Wallace, Colin Runciman
    Haskell and XML: Generic Combinators or Type-Based Translation? [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:148-159 [Conf]
  20. Graeme E. Moss, Colin Runciman
    Auburn: A Kit for Benchmarking Functional Data Structures. [Citation Graph (0, 0)][DBLP]
    Implementation of Functional Languages, 1997, pp:141-159 [Conf]
  21. Nathan Charles, Colin Runciman
    An Interactive Approach to Profiling Parallel Functional Programs. [Citation Graph (0, 0)][DBLP]
    IFL, 1998, pp:20-37 [Conf]
  22. Olaf Chitil, Dan McNeill, Colin Runciman
    Lazy Assertions. [Citation Graph (0, 0)][DBLP]
    IFL, 2003, pp:1-19 [Conf]
  23. Olaf Chitil, Colin Runciman, Malcolm Wallace
    Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. [Citation Graph (0, 0)][DBLP]
    IFL, 2000, pp:176-193 [Conf]
  24. Olaf Chitil, Colin Runciman, Malcolm Wallace
    Transforming Haskell for Tracing. [Citation Graph (0, 0)][DBLP]
    IFL, 2002, pp:165-181 [Conf]
  25. Colin Runciman, Niklas Röjemo
    Two-Pass Heap Profiling: A Matter of Life and Death. [Citation Graph (0, 0)][DBLP]
    Implementation of Functional Languages, 1996, pp:222-232 [Conf]
  26. Jan Sparud, Colin Runciman
    Complete and Partial Redex Trails of Functional Computations. [Citation Graph (0, 0)][DBLP]
    Implementation of Functional Languages, 1997, pp:160-177 [Conf]
  27. Malcolm Wallace, Colin Runciman
    The Bits Between The Lambdas: Binary Data in a Lazy Functional Language. [Citation Graph (0, 0)][DBLP]
    ISMM, 1998, pp:107-117 [Conf]
  28. Graeme E. Moss, Colin Runciman
    Automated Benchmarking of Functional Data Structures. [Citation Graph (0, 0)][DBLP]
    PADL, 1999, pp:1-15 [Conf]
  29. Dave Cattrall, Colin Runciman
    A Relational Programming System with Inferred Representations. [Citation Graph (0, 0)][DBLP]
    PLILP, 1992, pp:475-476 [Conf]
  30. Rob Noble, Colin Runciman
    Gadgets: Lazy Functional Components for Graphical User Interfaces [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:321-340 [Conf]
  31. Jan Sparud, Colin Runciman
    Tracing Lazy Functional Computations Using Redex Trails. [Citation Graph (0, 0)][DBLP]
    PLILP, 1997, pp:291-308 [Conf]
  32. Adam Bakewell, Colin Runciman
    A model for comparing the space usage of lazy evaluators. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:151-162 [Conf]
  33. Adam Bakewell, Colin Runciman
    The space usage problem: An evaluation kit for graph reduction semantics. [Citation Graph (0, 0)][DBLP]
    Scottish Functional Programming Workshop, 2000, pp:115-128 [Conf]
  34. C. W. Johnson, Colin Runciman
    Semantic Errors - Diagnosis and Repair. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Symposium on Compiler Construction, 1982, pp:88-97 [Conf]
  35. Colin Runciman
    What About the Natural Numbers? [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1989, v:14, n:3, pp:181-191 [Journal]
  36. Adam Bakewell, Colin Runciman
    A Space Semantics for Core Haskell. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:1, pp:- [Journal]
  37. Colin Runciman, Harold W. Thimbleby
    Equal Opportunity Interactive Systems. [Citation Graph (0, 0)][DBLP]
    International Journal of Man-Machine Studies, 1986, v:25, n:4, pp:439-451 [Journal]
  38. Graeme E. Moss, Colin Runciman
    Inductive benchmarking for purely functional data structures. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2001, v:11, n:5, pp:525-556 [Journal]
  39. Colin Runciman
    Lazy Wheel Sieves and Spirals of Primes. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:2, pp:219-225 [Journal]
  40. Colin Runciman, Niklas Röjemo
    New Dimensions in Heap Profiling. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:4, pp:587-620 [Journal]
  41. Colin Runciman, Ian Toyn
    Retrieving Reusable Software Components by Polymorphic Type. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1991, v:1, n:2, pp:191-211 [Journal]
  42. Colin Runciman, Ian Toyn, Mike Firth
    An Incremental, Exploratory and Transformational Environment for the Lazy Functional Programming. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1993, v:3, n:1, pp:93-115 [Journal]
  43. Colin Runciman, David Wakeling
    Heap Profiling of Lazy Functional Programs. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1993, v:3, n:2, pp:217-245 [Journal]
  44. Colin Runciman, Nigel Jagger
    Relative Specification and Transformational Re-Use of Functional Programs. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1990, v:3, n:1, pp:21-37 [Journal]
  45. Ian Toyn, Colin Runciman
    Adapting Combinator and SEC Machines to Display Snapshots of Functional Computations. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1986, v:4, n:4, pp:339-363 [Journal]
  46. Malcolm Wallace, Colin Runciman
    Extending a Functional Programming System for Embedded Applications. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1995, v:25, n:1, pp:73-96 [Journal]
  47. Tatsuru Matsushita, Colin Runciman
    The accepting power of unary string logic programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:59-79 [Journal]
  48. David Duke, Malcolm Wallace, Rita Borgo, Colin Runciman
    Fine-grained Visualization Pipelines and Lazy Functional Languages. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2006, v:12, n:5, pp:973-980 [Journal]
  49. Neil Mitchell, Colin Runciman
    A static checker for safe pattern matching in Haskell. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:15-30 [Conf]
  50. Andy Gill, Colin Runciman
    Haskell program coverage. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:1-12 [Conf]
  51. Neil Mitchell, Colin Runciman
    Uniform boilerplate and list processing. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:49-60 [Conf]
  52. Matthew Naylor, Emil Axelsson, Colin Runciman
    A functional-logic library for wired. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:37-48 [Conf]

  53. Experience report: visualizing data through functional pipelines. [Citation Graph (, )][DBLP]


  54. A Supercompiler for Core Haskell. [Citation Graph (, )][DBLP]


  55. The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA. [Citation Graph (, )][DBLP]


  56. Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs. [Citation Graph (, )][DBLP]


  57. Finding Inputs that Reach a Target Expression. [Citation Graph (, )][DBLP]


  58. Losing functions without gaining data: another look at defunctionalisation. [Citation Graph (, )][DBLP]


  59. Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. [Citation Graph (, )][DBLP]


  60. Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. [Citation Graph (, )][DBLP]


Search in 0.494secs, Finished in 0.496secs
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