MRG Project Logo

Mobile Resource Guarantees
(MRG, project IST-2001-33149)

The MRG project was funded in 2002-2005 under the Global Computing pro-active initiative of the Future and Emerging Technologies part of the Information Society Technologies programme of the European Commission's Fifth Framework Programme.

Related Projects

Other Publications by Project Members

The following list has been automatically generated from gc-us.bib.
It was last updated on the 18th March 2005.
  • Martin Hofmann. Safe recursion with higher types and BCK-algebra. In Annals of Pure and Applied Logic, 2000.

  • David Aspinall and Adriana Compagnoni. Heap Bounded Assembly Language. In Journal of Automated Reasoning (Special Issue on Proof-Carrying Code), 2003, Vol. 31, pages 261-302.

  • David Aspinall and Martin Hofmann. Heap Bounded Functional Programming in Java. Unpublished, 2001.

  • David Aspinall and Martin Hofmann. Read Only Types and Functional In-place Update. Unpublished, 2001.

  • David Aspinall. Subtyping with Power Types. In Proc. Computer Science Logic, CSL 2000, Fischbachau/Munich, Germany, Springer, 2000. Link...

  • David Aspinall and Adriana Compagnoni. Subtyping Dependent Types. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, New Brunswick, New Jersey, 1996, pages 86-97. Link...

  • Martin Hofmann. Linear types and non size-increasing polynomial time computation. UNPUBLISHED, 2000.

  • Martin Hofmann. Programming languages capturing complexity classes. In SIGACT News Logic Column, 2000, Vol. 9.

  • Martin Hofmann. A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion. In Proceedings of CSL '97, Aarhus. Springer LNCS 1414, 1998, pages 275-294.

  • Martin Hofmann. An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. In Bulletin of Symbolic Logic, 1997, Vol. 3, No. 4, pages 469-485.

  • Martin Hofmann. Typed lambda calculi for polynomial-time computation. MISC, 1999.

  • Martin Hofmann. A type system for bounded space and functional in-place update. In Nordic Journal of Computing, 2000, Vol. 7, No. 4, pages 258-289.

  • Stephen Gilmore, Dilsun Kirli and Chris Walton. Dynamic ML without Dynamic Types. TechReport, 1997, No. ECS-LFCS-97-378.

  • Stephen Gilmore, Dilsun Kirli and Chris Walton. An Abstract Machine Model of Dynamic Module Replacement. In Future Generation Computer Systems, 2000, Vol. 16, pages 793-808.

  • Stephen Gilmore. Deep type inference for mobile functions. In Trends in Functional Programming (Volume 1), 2000, pages 40-48.

  • Stephen Gilmore and Marco Palomino. BabylonLite: Improvements to a Java-based Distributed Object System. In Proc. 4th CaberNet Plenary Workshop, Pisa, 2001.

  • Samson Abramsky, Dan Ghica, Andrzej Murawski, Luke Ong and Ian Stark. Nominal Games and Full Abstraction for the Nu-Calculus. In Proceedings of the Nineteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2004, pages 150-159. [pdf] Link...

  • Sam Lindley and Ian Stark. Reducibility and toptop-lifting for Computation Types. In Typed Lambda Calculi and Applications: Proceedings of the Seventh International Conference TLCA 2005, Springer-Verlag, 2005.

  • Ulrich Sch?pp and Ian Stark. A Dependent Type Theory with Names and Binding. In Computer Science Logic: Proceedings of the 18th International Workshop CSL 2004, Springer-Verlag, 2004, No. 3210, pages 235-249. [pdf] Link...

  • Ian Stark. Free-Algebra Models for the pi-Calculus. In Foundations of Software Science and Computation Structures: Proceedings of FOSSACS 2005, Springer-Verlag, 2005, No. 3441, pages 155-169. [pdf] Link...

  • H-W. Loidl. The Virtual Shared Memory Performance of a Parallel Graph Reducer. In CCGrid 2002 -- International Symposium on Cluster Computing and the Grid, IEEE Computer Society, May 21-24, 2002, Berlin, Germany, 2002, pages 311-318. [postscript]

  • A. Rauber Du Bois, H-W. Loidl and P. Trinder. Thread Migration in a Parallel Graph Reducer. In IFL'02 -- Intl. Workshop on the Implementation of Functional Languages, Springer-Verlag, LNCS, Madrid, Spain, September 16-18, 2002, Vol. 2670, pages 199-214. [postscript]

  • A.J. Rebon Portillo, K. Hammond,, H-W. Loidl and P. Vasconcelos. Cost Analysis using Automatic Size and Time Inference. In IFL'02 -- Intl. Workshop on the Implementation of Functional Languages, Springer-Verlag, LNCS, Madrid, Spain, September 16-18, 2002, Vol. 2670, pages 232-247. [postscript]

  • A. Rauber Du Bois, R. Pointon, H-W. Loidl and P. Trinder. A Declarative Parallel Bottom-Avoiding Choice. In SBAC-PAD 2002 - Symposium on Computer Architecture and High Performance Computing, Vitoria, Brazil, October 28-30,, 2002. [postscript]

  • A. Rauber Du Bois, P. Trinder and H-W. Loidl. Mobile Computation in Haskell. In WFLP'03: 12th Int'l Workshop on Functional and (Constraint) Logic Programming, Valencia, Spain, June 2003. [postscript]

  • H-W. Loidl, Rubio Diez, F., Scaife, N.R., Hammond, K., Klusik, U., Loogen, R., Michaelson, G.J., Horiguchi, S., Pena Mari, R., Priebe, S.M., Rebon Portillo, A.J. and P. TrinderW.. Comparing Parallel Functional Languages: Programming and Performance. In Higher-order and Symbolic Computation, 2003, Vol. 16, No. 3, pages 203-251. [postscript]

  • A. Rauber Du Bois, P. Trinder and H-W. Loidl. Towards Mobility Skeletons. In CMPP'04 -- Intl. Workshop on Constructive Methods for Parallel Programming, Stirling, Scotland, July 2004. [postscript]

  • M. Lange, and H-W. Loidl. Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. In PDMC'04: Intl. Workshop on Parallel and Distributed Techniques in Verification, Elsevier, ENTCS, London, UK, September 2004, Vol. 128, No. 3. [postscript]

  • A. Al Zain, P. Trinder, H-W. Loidl and G.J. Michaelson. Managing Heterogeneity in a Grid Parallel Haskell. In PAPP'05: Second International Workshop on Practical Aspects of High-level Parallel Programming, Atlanta, USA, May 22-25, 2005. [postscript]

  • A. Rauber Du Bois, P. Trinder and H-W. Loidl. mHaskell: Mobile Computation in a Purely Functional Language. In SBLP'05: 9th Brazilian Symposium on Programming Languages, Recife, Brazil, May 23-25, 2005. [postscript]

  • J. Power and O. Shkaravska. From Comodels to Coalgebras: State and Arrays. In CMCS'2004: 7th Intl. Workshop on Coalgebraic Methods in Computer Science, Elsevier, ENTCS, Barcelona, Spain, March 2004, Vol. 106.

These pages are hosted by the Informatics Groups server at the University of Edinburgh.
Site maintained by Robert Atkey. This page last updated on: 2004-07-15.

Valid HTML 4.01!
Validate this page