643 search results - page 3 / 129 » Semantic Determinism and Functional Logic Program Properties |
IWINAC
2007
Springer
15 years 3 months ago
2007
Springer
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
110
click to vote
TLDI
2010
ACM
14 years 9 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
100
click to vote
ICLP
2004
Springer
15 years 2 months ago
2004
Springer
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
133
click to vote
PLPV
2011
ACM
14 years 7 days ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...