default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Runciman
Person information
- affiliation: University of York, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Ralf Hinze
, Colin Runciman:
Super-naturals. J. Funct. Program. 32: e5 (2022)- [j18]Stefan Kahrs, Colin Runciman:
Simplifying regular expressions further. J. Symb. Comput. 109: 124-143 (2022)
2010 – 2019
- 2018
- [c65]Michael Walker, Colin Runciman:
Cheap Remarks About Concurrent Programs. FLOPS 2018: 264-279 - 2017
- [c64]Rudy Braquehais, Colin Runciman:
Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results. Haskell 2017: 40-51 - [c63]Rudy Braquehais, Colin Runciman:
Extrapolate: generalizing counterexamples of functional test properties. IFL 2017: 3:1-3:11 - 2016
- [c62]Rudy Braquehais, Colin Runciman:
FitSpec: refining property sets for functional testing. Haskell 2016: 1-12 - [c61]Olaf Chitil, Maarten Faddegon, Colin Runciman:
A Lightweight Hat: Simple Type-Preserving Instrumentation for Self-Tracing Lazy Functional Programs. IFL 2016: 10:1-10:14 - 2015
- [c60]Michael Walker, Colin Runciman:
Déjà Fu: a concurrency testing library for Haskell. Haskell 2015: 141-152 - [c59]José Manuel Calderón Trilla, Colin Runciman:
Improving implicit parallelism. Haskell 2015: 153-164 - [c58]José Manuel Calderón Trilla, Simon M. Poulding, Colin Runciman:
Weaving Parallel Threads - Searching for Useful Parallelism in Functional Programs. SSBSE 2015: 62-76 - [c57]Christopher Bak, Glyn Faulkner, Detlef Plump, Colin Runciman:
A Reference Interpreter for the Graph Programming Language GP 2. GaM 2015: 48-64 - 2012
- [j17]Matthew Naylor, Colin Runciman:
The Reduceron reconfigured and re-evaluated. J. Funct. Program. 22(4-5): 574-613 (2012) - [c56]Jason S. Reich, Matthew Naylor, Colin Runciman:
Advances in Lazy SmallCheck. IFL 2012: 53-70 - 2011
- [c55]Jason S. Reich, Matthew Naylor, Colin Runciman:
Lazy Generation of Canonical Test Programs. IFL 2011: 69-84 - 2010
- [c54]Matthew Naylor, Colin Runciman:
The reduceron reconfigured. ICFP 2010: 75-86
2000 – 2009
- 2009
- [j16]Matthew Naylor, Colin Runciman:
Expressible sharing for functional circuit description. High. Order Symb. Comput. 22(1): 67-80 (2009) - [c53]Neil Mitchell, Colin Runciman:
Losing functions without gaining data: another look at defunctionalisation. Haskell 2009: 13-24 - [c52]David J. Duke, Rita Borgo, Malcolm Wallace, Colin Runciman:
Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs. PADL 2009: 31-45 - 2008
- [c51]Colin Runciman, Matthew Naylor, Fredrik Lindblad:
Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. Haskell 2008: 37-48 - [c50]Neil Mitchell, Colin Runciman:
Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. Haskell 2008: 49-60 - [c49]David J. Duke, Rita Borgo, Colin Runciman, Malcolm Wallace:
Experience report: visualizing data through functional pipelines. ICFP 2008: 379-382 - 2007
- [c48]Andy Gill, Colin Runciman:
Haskell program coverage. Haskell 2007: 1-12 - [c47]Matthew Naylor, Emil Axelsson, Colin Runciman:
A functional-logic library for wired. Haskell 2007: 37-48 - [c46]Neil Mitchell, Colin Runciman:
Uniform boilerplate and list processing. Haskell 2007: 49-60 - [c45]Matthew Naylor, Colin Runciman:
The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA. IFL 2007: 129-146 - [c44]Neil Mitchell, Colin Runciman:
A Supercompiler for Core Haskell. IFL 2007: 147-164 - [c43]Matthew Naylor, Colin Runciman:
Finding Inputs that Reach a Target Expression. SCAM 2007: 133-142 - 2006
- [j15]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) - 2005
- [c42]Neil Mitchell, Colin Runciman:
A static checker for safe pattern matching in Haskell. Trends in Functional Programming 2005: 15-30 - 2003
- [c41]Adam Bakewell, Detlef Plump, Colin Runciman:
Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61 - [c40]Adam Bakewell, Detlef Plump, Colin Runciman:
Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44 - [c39]Olaf Chitil, Dan McNeill, Colin Runciman:
Lazy Assertions. IFL 2003: 1-19 - [e1]Colin Runciman, Olin Shivers:
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 [contents] - 2002
- [c38]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 - [c37]Olaf Chitil, Colin Runciman, Malcolm Wallace:
Transforming Haskell for Tracing. IFL 2002: 165-181 - 2001
- [j14]Graeme E. Moss, Colin Runciman:
Inductive benchmarking for purely functional data structures. J. Funct. Program. 11(5): 525-556 (2001) - [j13]Tatsuru Matsushita, Colin Runciman:
The accepting power of unary string logic programs. Theor. Comput. Sci. 266(1-2): 59-79 (2001) - 2000
- [c36]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 - [c35]Adam Bakewell, Colin Runciman:
A model for comparing the space usage of lazy evaluators. PPDP 2000: 151-162 - [c34]Adam Bakewell, Colin Runciman:
The space usage problem: An evaluation kit for graph reduction semantics. Scottish Functional Programming Workshop 2000: 115-128 - [c33]Adam Bakewell, Colin Runciman:
A Space Semantics for Core Haskell. Haskell 2000: 36
1990 – 1999
- 1999
- [c32]Adam Bakewell, Colin Runciman:
Automated Generalisation of Function Definitions. Fuji International Symposium on Functional and Logic Programming 1999: 225-240 - [c31]Malcolm Wallace, Colin Runciman:
Haskell and XML: Generic Combinators or Type-Based Translation? ICFP 1999: 148-159 - [c30]Graeme E. Moss, Colin Runciman:
Automated Benchmarking of Functional Data Structures. PADL 1999: 1-15 - [p1]Nathan Charles, Colin Runciman:
Performance Monitoring. Research Directions in Parallel Functional Programming 1999: 233-246 - 1998
- [c29]Nathan Charles, Colin Runciman:
An Interactive Approach to Profiling Parallel Functional Programs. IFL 1998: 20-37 - [c28]Malcolm Wallace, Colin Runciman:
The Bits Between The Lambdas: Binary Data in a Lazy Functional Language. ISMM 1998: 107-117 - 1997
- [j12]Colin Runciman:
Lazy Wheel Sieves and Spirals of Primes. J. Funct. Program. 7(2): 219-225 (1997) - [c27]Graeme E. Moss, Colin Runciman:
Auburn: A Kit for Benchmarking Functional Data Structures. Implementation of Functional Languages 1997: 141-159 - [c26]Jan Sparud, Colin Runciman:
Complete and Partial Redex Trails of Functional Computations. Implementation of Functional Languages 1997: 160-177 - [c25]Jan Sparud, Colin Runciman:
Tracing Lazy Functional Computations Using Redex Trails. PLILP 1997: 291-308 - 1996
- [j11]Colin Runciman, Niklas Röjemo:
New Dimensions in Heap Profiling. J. Funct. Program. 6(4): 587-620 (1996) - [c24]Colin Runciman, Niklas Röjemo:
Heap Profiling for Space Efficiency. Advanced Functional Programming 1996: 159-183 - [c23]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 - [c22]Niklas Röjemo, Colin Runciman:
Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited. ICFP 1996: 34-41 - [c21]Colin Runciman, Niklas Röjemo:
Two-Pass Heap Profiling: A Matter of Life and Death. Implementation of Functional Languages 1996: 222-232 - 1995
- [j10]Malcolm Wallace, Colin Runciman:
Extending a Functional Programming System for Embedded Applications. Softw. Pract. Exp. 25(1): 73-96 (1995) - [c20]Malcolm Wallace, Colin Runciman:
Lambdas in the Liftshaft - Functional Programming and an Embedded Architecture. FPCA 1995: 249-258 - [c19]Rob Noble, Colin Runciman:
Gadgets: Lazy Functional Components for Graphical User Interfaces. PLILP 1995: 321-340 - 1994
- [c18]Sandra P. Foubister, Colin Runciman:
Techniques for Simplifying the Visualization of Graph Reduction. Functional Programming 1994: 66-77 - [c17]Colin Runciman:
Binding-time Improvement and Fold/Unfold Transformation. Functional Programming 1994: 218-230 - [c16]Malcolm Wallace, Colin Runciman:
Type-Checked Message-Passing between Functional Processes. Functional Programming 1994: 245-254 - 1993
- [j9]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) - [j8]Colin Runciman, David Wakeling:
Heap Profiling of Lazy Functional Programs. J. Funct. Program. 3(2): 217-245 (1993) - [c15]Colin Runciman, David Wakeling:
Profiling Parallel Functional Computations (Without Parallel Machines). Functional Programming 1993: 236-251 - [c14]Dave Cattrall, Colin Runciman:
Widening the Representation Bottleneck: A Functional Implementation of Relational Programming. FPCA 1993: 191-200 - 1992
- [c13]Colin Runciman, David Wakeling:
Heap Profiling of a Lazy Functional Compiler. Functional Programming 1992: 203-214 - [c12]Paul Sanders, Colin Runciman:
LZW Text Compression in Haskell. Functional Programming 1992: 215-226 - [c11]Dave Cattrall, Colin Runciman:
A Relational Programming System with Inferred Representations. PLILP 1992: 475-476 - 1991
- [j7]Colin Runciman, Ian Toyn:
Retrieving Reusable Software Components by Polymorphic Type. J. Funct. Program. 1(2): 191-211 (1991) - [c10]Colin Runciman:
TIP in Haskell - another Exercise in Functional Programming. Functional Programming 1991: 278-292 - [c9]David Wakeling, Colin Runciman:
Linearity and Laziness. FPCA 1991: 215-240 - 1990
- [j6]Colin Runciman, Nigel Jagger:
Relative Specification and Transformational Re-Use of Functional Programs. LISP Symb. Comput. 3(1): 21-37 (1990) - [c8]Colin Runciman, Mike Firth:
Formalised development of software by machine assisted transformation. Formal Methods in Software Development 1990: 115-117 - [c7]Colin Runciman, David Wakeling:
Problems & Proposals for Time & Space Profiling of Functional Programs. Functional Programming 1990: 237-245
1980 – 1989
- 1989
- [j5]Colin Runciman:
What About the Natural Numbers? Comput. Lang. 14(3): 181-191 (1989) - [c6]Colin Runciman, Mike Firth, Nigel Jagger:
Transformation in a Non-Strict Language: An Approach to Instantiation. Functional Programming 1989: 133-141 - [c5]Colin Runciman, Ian Toyn:
Retrieving Re-Usable Software Components by Polymorphic Type. FPCA 1989: 166-173 - 1987
- [j4]Colin Runciman:
Some software tools used in the development of the prototype york ada compiler. Softw. Eng. J. 2(4): 140-144 (1987) - [c4]Alan J. Dix, Michael D. Harrison, Colin Runciman, Harold W. Thimbleby:
Interaction Models and the Principled Design of Interactive Systems. ESEC 1987: 118-126 - [c3]Ian Toyn, Alan J. Dix, Colin Runciman:
Performance polymorphism. FPCA 1987: 325-346 - 1986
- [j3]Colin Runciman, Harold W. Thimbleby:
Equal Opportunity Interactive Systems. Int. J. Man Mach. Stud. 25(4): 439-451 (1986) - [j2]Ian Toyn, Colin Runciman:
Adapting Combinator and SEC Machines to Display Snapshots of Functional Computations. New Gener. Comput. 4(4): 339-363 (1986) - [c2]Colin Runciman:
Deriving Functional Programs from Equational Specifications. ADT 1986 - 1983
- [b1]Colin Runciman:
Interpreting algebraic specifications. University of York, UK, 1983 - 1982
- [c1]C. W. Johnson, Colin Runciman:
Semantic Errors - Diagnosis and Repair. SIGPLAN Symposium on Compiler Construction 1982: 88-97
1970 – 1979
- 1979
- [j1]Colin Runciman:
Scarcely variabled programming and Pascal. ACM SIGPLAN Notices 14(11): 97-106 (1979)
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 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
