31 search results - page 2 / 7 » A New One-Pass Transformation into Monadic Normal Form |
LICS
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
FLAIRS
2007
13 years 7 months ago
2007
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
In the past several years, we’ve been studying feature transformation (FT) approaches to robust automatic speech recognition (ASR) which can compensate for possible “distortio...
HASKELL
2008
ACM
13 years 5 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
ISMVL
1999
IEEE
13 years 9 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...