191 search results - page 21 / 39 » A Reasoner for Simple Conceptual Logic Programs |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
189
click to vote
ICFP
2009
ACM
16 years 12 days ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
ICFP
2010
ACM
15 years 25 days ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
CADE
2006
Springer
16 years 1 days 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 ...
CADE
2006
Springer
16 years 1 days ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...