377 search results - page 40 / 76 » Modular logic metaprogramming |
IJAR
2007
14 years 11 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
FPGA
2001
ACM
15 years 4 months ago
2001
ACM
A prototype platform has been developed that allows processing of packets at the edge of a multi-gigabit-per-second network switch. This system, the Field Programmable Port Extend...
193
click to vote
POPL
2007
ACM
16 years 3 days ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
113
click to vote
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
NDJFL
1998
14 years 11 months ago
1998
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...