Next: About this document ...
Up: Implicit Computational Complexity and
Previous: Light Affine Logic and
- MO00
-
A. S. Murawski and C.-H. L. Ong.
Discreet games, Light Affine Logic and PTIME computation.
In Proceedings of CSL2000, Annual Conference of the European
Association of Computer Science Logic, August 2000, Fischbachau, Germany.,
pages 427-441. Springer-Verlag, 2000.
LNCS Vol. 1862.
- MO01a
-
A. S. Murawski and C.-H. L. Ong.
Can safe recursion be interpreted in light logic?
Presented at the Second International Workshop on Implicit
Computational Complexity, Santa Barbara, California, 29 - 30 June 2000;
submitted to Theoretical Computer Science, 31 pages, April 2001.
- MO01b
-
A. S. Murawski and C.-H. L. Ong.
Evolving games and essential nets for affine polymorphism.
In Typed Lambda Calculi and Applications: Proc. 5th
Int. Conf. TLCA2001, Krakow, Poland, May 2001, pages 360-375.
Springer-Verlag, 2001.
LNCS Vol. 2044.
Luke Ong
2002-10-05