Sciweavers

LICS
1994
IEEE
14 years 1 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
LICS
1994
IEEE
14 years 1 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
LICS
1994
IEEE
14 years 1 months ago
Categories, Allegories and Circuit Design
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
Carolyn Brown, Graham Hutton
LICS
1994
IEEE
14 years 1 months ago
A Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Dale Miller
LICS
1994
IEEE
14 years 1 months ago
Linear Logic, Totality and Full Completeness
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
Ralph Loader
Automated Reasoning
Top of PageReset Settings