Sciweavers

367 search results - page 52 / 74
» Adapting functional programs to higher order logic
Sort
View
ICFP
2010
ACM
13 years 9 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
APAL
2008
104views more  APAL 2008»
13 years 8 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
MICRO
2002
IEEE
131views Hardware» more  MICRO 2002»
13 years 8 months ago
Protocol Wrappers for Layered Network Packet Processing in Reconfigurable Hardware
abstracting the operation of lower-level packet processing functions. The library synthesizes into field-programmable gate array (FPGA) logic and is utilized in a network platform ...
Florian Braun, John W. Lockwood, Marcel Waldvogel
DAC
2004
ACM
14 years 12 days ago
An SoC design methodology using FPGAs and embedded microprocessors
In System on Chip (SoC) design, growing design complexity has esigners to start designs at higher abstraction levels. This paper proposes an SoC design methodology that makes full...
Nobuyuki Ohba, Kohji Takano
CADE
1998
Springer
14 years 27 days ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...