University of Limerick Institutional Repository

Browsing by Author "Hamilton, Geoff W."

DSpace/Manakin Repository

Browsing by Author "Hamilton, Geoff W."

Sort by: Order: Results:

  • Dever, Michael; Hamilton, Geoff W. (2012)
    Creating efficient parallel software can be a complicated and time consuming task, as there are many issues that need to be considered, such as race-conditions, thread-bound data dependencies and locking issues, among ...
  • Dever, Michael; Hamilton, Geoff W. (META 2012, 2012)
    Program transformation is a popular technique for attempting to improve the e ciency of a program. At a high level, program transformation is the process of taking an input program and transforming it into an improved ...
  • Hamilton, Geoff W.; Kabir, M.H. (2008)
    It has previously been shown by Turchin in the context of supercompilation how metasystem transitions can be used in the proof of universally and existentially quantified conjectures. Positive supercompilation is a ...
  • Mendel-Gleason, Gavin E.; Hamilton, Geoff W. (Meta 2012, 2012)
    Proofs involving infinite structures can use corecursive functions as inhabitants of a corecursive type. Admissibility of such functions in theorem provers such as Coq or Agda, requires that these functions are productive. ...
  • Hamilton, Geoff W.; Jones, Neil D. (Association for Computing Machinery, 2012)
    In this paper, we provide an improved basis for the “distillation” program transformation. It is known that superlinear speedups can be obtained using distillation, but cannot be obtained by other earlier automatic ...
  • Hamilton, Geoff W. (Springer, 2009)
    In this paper, we give a re-formulation of our previously defined distillation algorithm, which can automatically transform higherorder functional programs into equivalent tail-recursive programs. Our re-formulation ...
  • Hamilton, Geoff W.; Mendel-Gleason, Gavin E. (Meta2010, 2010)
    In this paper, we give a graph-based definition of the distillation transformation algorithm. This definition is made within a similar framework to the positive supercompilation algorithm, thus allowing for a more in-depth ...
  • Hamilton, Geoff W. (2012)
    In this paper, we describe a hierarchy of program transformers in which the transformer at each level of the hierarchy builds on top of the transformers at lower levels. The program transformer at the bottom of the ...
  • Hamilton, Geoff W.; Jones, Neil D. (Springer, 2012)
    This paper shows that a bisimulation approach can be used to prove the correctness of unfold/fold program transformation algorithms. As an illustration, we show how our approach can be use to prove the correctness of ...
  • Mendel-Gleason, Gavin E.; Hamilton, Geoff W. (Meta2010, 2010)
    It has been long recognised that partial evaluation is related to proof normalisation. Normalisation by evaluation, which has been presented for theories with simple types, has made this correspondance formal. Recently ...

Search DSpace

Browse

My Account