67 search results - page 7 / 14 » A Theorem on Higher Bruhat Orders |
KI
1990
Springer
13 years 11 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
PLILP
1993
Springer
13 years 11 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
IEICET
2007
13 years 7 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...
POPL
1992
ACM
13 years 11 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...