Sciweavers

2076 search results - page 279 / 416
» Functional logic overloading
Sort
View
ICFP
2005
ACM
16 years 3 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
POPL
2010
ACM
16 years 17 days ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
15 years 9 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
DLOG
2004
15 years 4 months ago
Extended Query Facilities for Racer and an Application to Software-Engineering Problems
er reports on a pragmatic query language for Racer. The abstract syntax and semantics of this query language is defined. Next, the practical relevance of this query language is sh...
Volker Haarslev, Ralf Möller, Ragnhild Van De...
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 3 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...