L O ] 2 0 N ov 2 00 7 Intensional properties of polygraphs

@inproceedings{Bonfante2007LO,
  title={L O ] 2 0 N ov 2 00 7 Intensional properties of polygraphs},
  author={Guillaume Bonfante and Yves Guiraud},
  year={2007}
}
Abstract –We present polygraphic programs, a subclass of Albert Burro ni’s polygraphs, as a computational model, showing how these objects can be seen as first-o rder functional programs. We prove that the model is Turing complete. We use polygraphic interpreta tions, a termination proof method introduced by the second author, to characterize polygraphic… CONTINUE READING