Toggle Main Menu Toggle Search

ePrints

Formal development of correct algorithms: an example based on Earley’s recogniser

Lookup NU author(s): Professor Cliff Jones

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Publication metadata

Author(s): Jones CB

Publication type: Conference Proceedings (inc. Abstract)

Conference Name: ACM Conference on Proving Assertions about Programs

Year of Conference: 1972

Pages: 150-169

Publisher: ACM

Notes: Proceedings published as ACM SIGPLAN Notices vol.7, no.1, January,1972; also ACM SIGACT News no.14, January,1972.


Share