We present Timed Gentzen, a concrete tcc language instantiated over the ``generic'' constraint system Gentzen that underlies ``unification-free'' computation in (classical, intuitionistic, linear) logic. Subsequently, we present solutions to several representative reactive and synchronous programming problems in Timed Gentzen; also we discuss how some common default inferencing techniques can be represented. We discuss and include a full working interpreter for Timed Gentzen, written in prolog, that can be used for running these programs. It is short, under a hundred lines long, but fully functional.
© Springer Verlag, 1995.
@InProceedings{progg-tcc, author = "V. A. Saraswat and R. Jagadeesan and V. Gupta", editor = "B. Mayoh and E. Tyugu and J. Penjaam", booktitle = "Constraint Programming: Proceedings 1993 {NATO ASI Parnu, Estonia}", title = "Programming in Timed Concurrent Constraint Languages", chapter = "4.4", publisher = "Springer Verlag", pages = "361--410", year = "1994", volume = 131, series = "NATO Advanced Science Institute Series F: Computer and System Sciences" }Postscript file.