3572 search results - page 262 / 715 » Nominal Logic Programming |
164
Voted
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
194
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
150
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
181
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
182
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...