Colin Runciman

Matthew Naylor, Colin Runciman: The Reduceron reconfigured and re-evaluated. J. Funct. Program. 22(4-5): 574-613 (2012)

Jason S. Reich, Matthew Naylor, Colin Runciman: Lazy Generation of Canonical Test Programs. IFL 2011: 69-84

Matthew Naylor, Colin Runciman: The reduceron reconfigured. ICFP 2010: 75-86

Matthew Naylor, Colin Runciman: Expressible sharing for functional circuit description. Higher-Order and Symbolic Computation 22(1): 67-80 (2009)

Neil Mitchell, Colin Runciman: Losing functions without gaining data: another look at defunctionalisation. Haskell 2009: 13-24

David J. Duke, Rita Borgo, Malcolm Wallace, Colin Runciman: Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs. PADL 2009: 31-45

Colin Runciman, Matthew Naylor, Fredrik Lindblad: Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. Haskell 2008: 37-48

Neil Mitchell, Colin Runciman: Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. Haskell 2008: 49-60

David J. Duke, Rita Borgo, Colin Runciman, Malcolm Wallace: Experience report: visualizing data through functional pipelines. ICFP 2008: 379-382

Andy Gill, Colin Runciman: Haskell program coverage. Haskell 2007: 1-12

Matthew Naylor, Emil Axelsson, Colin Runciman: A functional-logic library for wired. Haskell 2007: 37-48

Neil Mitchell, Colin Runciman: Uniform boilerplate and list processing. Haskell 2007: 49-60

Matthew Naylor, Colin Runciman: The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA. IFL 2007: 129-146

Neil Mitchell, Colin Runciman: A Supercompiler for Core Haskell. IFL 2007: 147-164

Matthew Naylor, Colin Runciman: Finding Inputs that Reach a Target Expression. SCAM 2007: 133-142

David J. Duke, Malcolm Wallace, Rita Borgo, Colin Runciman: Fine-grained Visualization Pipelines and Lazy Functional Languages. IEEE Trans. Vis. Comput. Graph. 12(5): 973-980 (2006)

Neil Mitchell, Colin Runciman: A static checker for safe pattern matching in Haskell. Trends in Functional Programming 2005: 15-30

Adam Bakewell, Detlef Plump, Colin Runciman: Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61

Adam Bakewell, Detlef Plump, Colin Runciman: Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44

Olaf Chitil, Dan McNeill, Colin Runciman: Lazy Assertions. IFL 2003: 1-19

Colin Runciman, Olin Shivers (Eds.): Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003. ACM 2003, isbn 1-58113-756-7

Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, Malcolm Wallace: Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat. Advanced Functional Programming 2002: 59-99

Olaf Chitil, Colin Runciman, Malcolm Wallace: Transforming Haskell for Tracing. IFL 2002: 165-181

Graeme E. Moss, Colin Runciman: Inductive benchmarking for purely functional data structures. J. Funct. Program. 11(5): 525-556 (2001)

Tatsuru Matsushita, Colin Runciman: The accepting power of unary string logic programs. Theor. Comput. Sci. 266(1-2): 59-79 (2001)

Adam Bakewell, Colin Runciman: A Space Semantics for Core Haskell. Electr. Notes Theor. Comput. Sci. 41(1): 36 (2000)

Olaf Chitil, Colin Runciman, Malcolm Wallace: Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. IFL 2000: 176-193

Adam Bakewell, Colin Runciman: A model for comparing the space usage of lazy evaluators. PPDP 2000: 151-162

Adam Bakewell, Colin Runciman: The space usage problem: An evaluation kit for graph reduction semantics. Scottish Functional Programming Workshop 2000: 115-128

Adam Bakewell, Colin Runciman: Automated Generalisation of Function Definitions. Fuji International Symposium on Functional and Logic Programming 1999: 225-240

Malcolm Wallace, Colin Runciman: Haskell and XML: Generic Combinators or Type-Based Translation? ICFP 1999: 148-159

Graeme E. Moss, Colin Runciman: Automated Benchmarking of Functional Data Structures. PADL 1999: 1-15

Nathan Charles, Colin Runciman: An Interactive Approach to Profiling Parallel Functional Programs. IFL 1998: 20-37

Malcolm Wallace, Colin Runciman: The Bits Between The Lambdas: Binary Data in a Lazy Functional Language. ISMM 1998: 107-117

Colin Runciman: Lazy Wheel Sieves and Spirals of Primes. J. Funct. Program. 7(2): 219-225 (1997)

Graeme E. Moss, Colin Runciman: Auburn: A Kit for Benchmarking Functional Data Structures. Implementation of Functional Languages 1997: 141-159

Jan Sparud, Colin Runciman: Complete and Partial Redex Trails of Functional Computations. Implementation of Functional Languages 1997: 160-177

Jan Sparud, Colin Runciman: Tracing Lazy Functional Computations Using Redex Trails. PLILP 1997: 291-308

Colin Runciman, Niklas Röjemo: New Dimensions in Heap Profiling. J. Funct. Program. 6(4): 587-620 (1996)

Colin Runciman, Niklas Röjemo: Heap Profiling for Space Efficiency. Advanced Functional Programming 1996: 159-183

Andrew Douglas, Niklas Röjemo, Colin Runciman, Alan Wood: Astro-Gofer: Parallel Functional Programming with Co-ordinating Processes. Euro-Par, Vol. I 1996: 686-693

Niklas Röjemo, Colin Runciman: Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited. ICFP 1996: 34-41

Colin Runciman, Niklas Röjemo: Two-Pass Heap Profiling: A Matter of Life and Death. Implementation of Functional Languages 1996: 222-232

Malcolm Wallace, Colin Runciman: Extending a Functional Programming System for Embedded Applications. Softw., Pract. Exper. 25(1): 73-96 (1995)

Malcolm Wallace, Colin Runciman: Lambdas in the Liftshaft - Functional Programming and an Embedded Architecture. FPCA 1995: 249-258

Rob Noble, Colin Runciman: Gadgets: Lazy Functional Components for Graphical User Interfaces. PLILP 1995: 321-340

Colin Runciman, Ian Toyn, Mike Firth: An Incremental, Exploratory and Transformational Environment for the Lazy Functional Programming. J. Funct. Program. 3(1): 93-115 (1993)

Colin Runciman, David Wakeling: Heap Profiling of Lazy Functional Programs. J. Funct. Program. 3(2): 217-245 (1993)

Dave Cattrall, Colin Runciman: Widening the Representation Bottleneck: A Functional Implementation of Relational Programming. FPCA 1993: 191-200

Colin Runciman, David Wakeling: Heap Profiling of a Lazy Functional Compiler. Functional Programming 1992: 203-214

Paul Sanders, Colin Runciman: LZW Text Compression in Haskell. Functional Programming 1992: 215-226

Dave Cattrall, Colin Runciman: A Relational Programming System with Inferred Representations. PLILP 1992: 475-476

Colin Runciman, Ian Toyn: Retrieving Reusable Software Components by Polymorphic Type. J. Funct. Program. 1(2): 191-211 (1991)

Colin Runciman: TIP in Haskell - another Exercise in Functional Programming. Functional Programming 1991: 278-292

David Wakeling, Colin Runciman: Linearity and Laziness. FPCA 1991: 215-240

Colin Runciman, Nigel Jagger: Relative Specification and Transformational Re-Use of Functional Programs. Lisp and Symbolic Computation 3(1): 21-37 (1990)

Colin Runciman: What About the Natural Numbers? Comput. Lang. 14(3): 181-191 (1989)

Colin Runciman, Mike Firth, Nigel Jagger: Transformation in a Non-Strict Language: An Approach to Instantiation. Functional Programming 1989: 133-141

Colin Runciman, Ian Toyn: Retrieving Re-Usable Software Components by Polymorphic Type. FPCA 1989: 166-173

Alan J. Dix, Michael D. Harrison, Colin Runciman, Harold W. Thimbleby: Interaction Models and the Principled Design of Interactive Systems. ESEC 1987: 118-126

Ian Toyn, Alan J. Dix, Colin Runciman: Performance polymorphism. FPCA 1987: 325-346

Colin Runciman, Harold W. Thimbleby: Equal Opportunity Interactive Systems. International Journal of Man-Machine Studies 25(4): 439-451 (1986)

Ian Toyn, Colin Runciman: Adapting Combinator and SEC Machines to Display Snapshots of Functional Computations. New Generation Comput. 4(4): 339-363 (1986)

Colin Runciman: Deriving Functional Programs from Equational Specifications. ADT 1986

C. W. Johnson, Colin Runciman: Semantic Errors - Diagnosis and Repair. SIGPLAN Symposium on Compiler Construction 1982: 88-97