4401 search results - page 231 / 881 » Computing with Default Logic |
129
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Recent advancements in FPGA technology have allowed manufacturers to place general-purpose processors alongside user-configurable logic gates on a single chip. At first glance, ...
131
Voted
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
137
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
158
click to vote
BIRTHDAY
2000
Springer
15 years 9 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
137
click to vote
ERSHOV
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Monads are a technique widely used in functional programming languages to address many different problems. This paper presents extensions, a functional-logic programming...