90 search results - page 15 / 18 » Free theorems for functional logic programs |
103
click to vote
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
IEE
2008
14 years 10 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
FMCAD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...