3658 search results - page 164 / 732 » The logic of proofs, semantically |
ESWS
2010
Springer
15 years 5 months ago
2010
Springer
—We present an intelligent service matchmaker, called iSeM, for adaptive and hybrid semantic service selection that exploits the full semantic profile in terms of signature anno...
132
click to vote
ICLP
1992
Springer
15 years 4 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
116
click to vote
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
117
click to vote
TLDI
2009
ACM
15 years 9 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
101
Voted
COORDINATION
2009
Springer
16 years 1 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...