525 search results - page 66 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
157
click to vote
MPC
2010
Springer
15 years 4 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
138
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
161
click to vote
PEPM
2010
ACM
15 years 4 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
108
click to vote
FOAL
2007
ACM
15 years 6 months ago
2007
ACM
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
159
Voted
PPDP
1999
Springer
15 years 7 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...