2540 search results - page 118 / 508 » Abstract Logics as Dialgebras |
129
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
164
click to vote
IJCAI
2003
15 years 7 months ago
2003
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...
161
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
169
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
181
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...