4257 search results - page 93 / 852 » The Logical Modularity of Programs |
106
Voted
MPC
2000
Springer
15 years 6 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
111
click to vote
PPDP
2010
Springer
15 years 28 days ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
141
Voted
CL
2000
Springer
15 years 6 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
148
Voted
ENTCS
2006
15 years 2 months ago
2006
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
121
Voted
ETAI
2000
15 years 2 months ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...